Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.

Author(s): Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind (auth.), Berthold Vöcking (eds.)
Series: Lecture Notes in Computer Science 8146
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2013

Language: English
Pages: 271
Tags: Simulation and Modeling; e-Commerce/e-business; Models and Principles; Computers and Society; Numeric Computing; Probability and Statistics in Computer Science

Front Matter....Pages -
The Complexity of Fully Proportional Representation for Single-Crossing Electorates....Pages 1-12
New Results on Equilibria in Strategic Candidacy....Pages 13-25
Plurality Voting with Truth-Biased Agents....Pages 26-37
Reliability Weighted Voting Games....Pages 38-49
The Power of Mediation in an Extended El Farol Game....Pages 50-61
Friend of My Friend: Network Formation with Two-Hop Benefit....Pages 62-73
Load Rebalancing Games in Dynamic Systems with Migration Costs....Pages 74-85
Stochastic Congestion Games with Risk-Averse Players....Pages 86-97
Congestion Games with Player-Specific Costs Revisited....Pages 98-109
Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information....Pages 110-121
Anti-coordination Games and Stable Graph Colorings....Pages 122-133
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree....Pages 134-145
Cooperative Equilibria in Iterated Social Dilemmas....Pages 146-158
Symmetries of Quasi-Values....Pages 159-170
Dividing Connected Chores Fairly....Pages 171-182
On Popular Random Assignments....Pages 183-194
Scheduling a Cascade with Opposing Influences....Pages 195-206
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games....Pages 207-218
Inefficiency of Games with Social Context....Pages 219-230
Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines....Pages 231-242
Imperfect Best-Response Mechanisms....Pages 243-254
Pricing Ad Slots with Consecutive Multi-unit Demand....Pages 255-266
Back Matter....Pages -