Abstract is missing.
- Two-Buyer Sequential Multiunit Auctions with No OverbiddingMete Seref Ahunbay, Brendan Lucier, Adrian Vetta. 3-16 [doi]
- Asymptotically Optimal Communication in Simple MechanismsIoannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos. 17-31 [doi]
- Finding Fair and Efficient Allocations When Valuations Don't Add UpNawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick. 32-46 [doi]
- Mechanism Design for Perturbation Stable Combinatorial AuctionsGiannis Fikioris, Dimitris Fotakis. 47-63 [doi]
- Congestion Games with Priority-Based SchedulingVittorio Bilò, Cosimo Vinci. 67-82 [doi]
- Equilibrium Inefficiency in Resource Buying Games with Load-Dependent CostsEirini Georgoulaki, Kostas Kollias, Tami Tamir. 83-98 [doi]
- A Unifying Approximate Potential for Weighted Congestion GamesYiannis Giannakopoulos, Diogo Poças. 99-113 [doi]
- The Impact of Spillback on the Price of Anarchy for Flows over TimeJonas Israel, Leon Sering. 114-129 [doi]
- Dynamic Equilibria in Time-Varying NetworksHoang Minh Pham, Leon Sering. 130-145 [doi]
- Price of Anarchy in Congestion Games with Altruistic/Spiteful PlayersMarc Schröder 0002. 146-159 [doi]
- Bribery and Control in Stable MarriageNiclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier. 163-177 [doi]
- Approximating Stable Matchings with Ties of Bounded SizeJochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade. 178-192 [doi]
- Envy-Freeness and Relaxed Stability: Hardness and Approximation AlgorithmsPrem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar. 193-208 [doi]
- Targeted Intervention in Random GraphsWilliam Brown, Utkarsh Patange. 211-225 [doi]
- A New Lower Bound for Deterministic Truthful SchedulingYiannis Giannakopoulos, Alexander Hammerl, Diogo Poças. 226-240 [doi]
- Modified Schelling GamesPanagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris. 241-256 [doi]
- Race Scheduling GamesShaul Rosner, Tami Tamir. 257-272 [doi]
- Line-Up Elections: Parallel Voting with Shared Candidate PoolNiclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk 0001, Rolf Niedermeier. 275-290 [doi]
- Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and AlgorithmsBruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová. 291-306 [doi]
- A General Framework for Computing the Nucleolus via Dynamic ProgrammingJochen Könemann, Justin Toth. 307-321 [doi]
- How Many Freemasons Are There? The Consensus Voting Mechanism in Metric SpacesMashbat Suzuki, Adrian Vetta. 322-336 [doi]