SAGT 2020 - Program
Wednesday, 16.9.:
Speakers are underlined for each paper.
We encourage all participants to pose questions only after the talk.
9:30 – 10:00 Opening and Gathering
Zoom
10:00 – 11:00 Keynote Talk
Chair: Max Klimm
- Paul Duetting: Contract Theory: A New Frontier for AGT
11:00 – 11:15 Coffee Break
11:15 – 12:45 S1: Stable Matchings 3x (25+5)-Minutes
Chair: Tobias Harks
- Best Paper Award: Könemann, Pashkovich, Tofigzade: Approximating Stable Matchings with Ties of Bounded Size
- Krishnaa, Limaye, Nasre, Nimbhorkar: Envy-freeness and Relaxed Stability: Hardness and Approximation Algorithms
- Boehmer, Bredereck, Heeger, Niedermeier: Bribery and Control in Stable Marriage
12:45 – 14:00 Break
14:00 – 15:30 S2: Auctions 3x (25+5)-Minutes
Chair: Dimitris Fotakis
- Ahunbay, Lucier, Vetta: Two-Buyer Sequential Multiunit Auctions with No Overbidding
- Anagnostides, Fotakis, Patsilinakos: Asymptotically Optimal Communication in Simple Mechanisms
- Benabbou, Chakraborty, Igarashi, Zick: Finding Fair and Efficient Allocations when Valuations Don’t Add Up
15:30 – 15:45 Coffee Break
15:45 – 17:15 S3: Auctions and Markets 3x (25+5)-Minutes
Chair: Justin Toth
- Fikioris, Fotakis: Mechanism Design for Perturbation Stable Combinatorial Auctions
- Kumar, Manocha, Ortega: On the Integration of Shapley-Scarf Matching Markets
- Koenemann, Toth: A General Framework for Computing the Nucleolus Via Dynamic Programming
Thursday, 17.9.
9:30 – 11:00 S4: Congestion Games 3x (25+5)-Minutes
Chair: Tami Tamir
- Georgoulaki, Kollias, Tamir: Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs
- Giannakopoulos, Noarov, Schulz: Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
- Giannakopoulos, Pocas: A Unifying Approximate Potential for Weighted Congestion Games
11:00 – 11:15 Coffee Break
11:15 – 12:45 S5: Scheduling and Games on Graphs 3x (25+5)-Minutes
Chair: Vittorio Biló
- Biló, Vinci: Congestion Games with Priority-Based Scheduling
- Brown, Patange: Targeted Intervention in Random Graphs
- Giannakopoulos, Hammerl, Pocas: A New Lower Bound for Deterministic Truthful Scheduling
12:45 – 14:00 Break
14:00 – 15:30 S6: Flows Over Time and Congestion Games 3x (25+5)-Minutes
Chair: Marc Schröder
- Pham, Sering: Dynamic Equilibria in Time-Varying Networks
- Israel, Sering: The Impact of Spillback on the Price of Anarchy for Flows Over Time
- Schröder: Price of Anarchy in Congestion Games with Altruistic/Spiteful Players
15:30 – 16:00 Coffee Break
16:00 – 17:00 Keynote Talk
Chair: Max Klimm
- Ruta Mehta: Equilibrium Computation: Old, New, and Beyond
Friday, 18.9.
9:30 – 11:00 S7: Social Choice and Cooperative Games 3x (25+5)-Minutes
Chair: Danny Blom
- Boehmer, Bredereck, Faliszewski, Kaczmarczyk, Niedermeier: Line-Up Elections: Parallel Voting with Shared Candidate Pool
- Escoffier, Spanjaard, Tydrichova: Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms
- Smeulders, Blom, Spieksma : The Stackelberg Kidney Exchange Problem is $ \sum{_2^P} $ -complete
11:00 – 11:15 Coffee Break
11:15 – 12:45 S8: Voting, Scheduling and Graph Games 3x (25+5)-Minutes
Chair: Mashbat Suzuki
- Suzuki, Vetta: How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces
- Rosner, Tamir: Race Scheduling Games
- Kanellopoulos, Kyropoulou, Voudouris: Modified Schelling Games
12:45 – 14:00 Break
14:00 – 15:00 Keynote Talk
Chair: Max Klimm
- Dirk Bergemann: The Economics of Social Data
15:00 Closing