Algorithmic Game Theory

1. Front Matter

   Pages I-XX

   PDF

2. On Revenue Monotonicity in Combinatorial Auctions

   • Andrew Chi-chih Yao

   Pages 1-11

3. Restricted Preference Domains in Social Choice: Two Perspectives

   • Edith Elkind

   Pages 12-18

4. The Complexity of Cake Cutting with Unequal Shares

   • Ágnes Cseh, Tamás Fleiner

   Pages 19-30

5. A Near Optimal Mechanism for Energy Aware Scheduling

   • Antonios Antoniadis, Andrés Cristi

   Pages 31-42

6. Information Elicitation for Bayesian Auctions

   • Jing Chen, Bo Li, Yingkai Li

   Pages 43-55

7. Coreness of Cooperative Games with Truncated Submodular Profit Functions

   • Wei Chen, Xiaohan Shan, Xiaoming Sun, Jialin Zhang

   Pages 56-68

8. Simple Games Versus Weighted Voting Games

   • Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma

   Pages 69-81

9. Hide and Seek Game with Multiple Resources

   • Marcin Dziubiński, Jaideep Roy

   Pages 82-86

10. An Improved Envy-Free Cake Cutting Protocol for Four Agents

    • Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou

    Pages 87-99

11. A Truthful Mechanism for Interval Scheduling

    • Jugal Garg, Peter McGlaughlin

    Pages 100-112

12. On Revenue-Maximizing Mechanisms Assuming Convex Costs

    • Amy Greenwald, Takehiro Oyakawa, Vasilis Syrgkanis

    Pages 113-124

13. On the Price of Stability of Social Distance Games

    • Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas

    Pages 125-136

14. Schelling Segregation with Strategic Agents

    • Ankit Chauhan, Pascal Lenzner, Louise Molitor

    Pages 137-149

15. Efficient Rational Proofs with Strong Utility-Gap Guarantees

    • Jing Chen, Samuel McCauley, Shikha Singh

    Pages 150-162

16. Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants

    • Moran Feldman, Rica Gonen

    Pages 163-175

17. A Two-Stage Mechanism for Ordinal Peer Assessment

    • Zhize Li, Le Zhang, Zhixuan Fang, Jian Li

    Pages 176-188

18. The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty

    • Xujin Chen, Xiaodong Hu, Chenhao Wang

    Pages 189-200

19. Online Trading as a Secretary Problem

    • Elias Koutsoupias, Philip Lazos

    Pages 201-212

20. Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation

    • Abdallah Saffidine, Anaëlle Wilczynski

    Pages 213-225

This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018.

The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.

• Agents
• Auction
• Cake-cutting
• Communication channels (information theory)
• Complexity
• Computer networks
• Electronic commerce
• Fairness
• Game theory
• Mechanism design
• Nash equilibrium
• Problem solving
• Quality of service
• Resource allocation
• Stability
• Strategy
• Submodular
• Telecommunication networks
• Voting
• Wireless telecommunication systems

• Peking University, Beijing, China

  Xiaotie Deng

Policies and ethics