Algorithmic Game Theory

6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings

Editors:

ISBN: 978-3-642-41391-9 (Print) 978-3-642-41392-6 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Voting

    1. No Access

      Book Chapter

      Pages 1-12

      The Complexity of Fully Proportional Representation for Single-Crossing Electorates

    2. No Access

      Book Chapter

      Pages 13-25

      New Results on Equilibria in Strategic Candidacy

    3. No Access

      Book Chapter

      Pages 26-37

      Plurality Voting with Truth-Biased Agents

    4. No Access

      Book Chapter

      Pages 38-49

      Reliability Weighted Voting Games

  3. Price of Anarchy

    1. No Access

      Book Chapter

      Pages 50-61

      The Power of Mediation in an Extended El Farol Game

    2. No Access

      Book Chapter

      Pages 62-73

      Friend of My Friend: Network Formation with Two-Hop Benefit

    3. No Access

      Book Chapter

      Pages 74-85

      Load Rebalancing Games in Dynamic Systems with Migration Costs

  4. Congestion Games

    1. No Access

      Book Chapter

      Pages 86-97

      Stochastic Congestion Games with Risk-Averse Players

    2. No Access

      Book Chapter

      Pages 98-109

      Congestion Games with Player-Specific Costs Revisited

    3. No Access

      Book Chapter

      Pages 110-121

      Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information

  5. Computational Aspects

    1. No Access

      Book Chapter

      Pages 122-133

      Anti-coordination Games and Stable Graph Colorings

    2. No Access

      Book Chapter

      Pages 134-145

      Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree

  6. Alternative Solution Concepts

    1. No Access

      Book Chapter

      Pages 146-158

      Cooperative Equilibria in Iterated Social Dilemmas

    2. No Access

      Book Chapter

      Pages 159-170

      Symmetries of Quasi-Values

    3. No Access

      Book Chapter

      Pages 171-182

      Dividing Connected Chores Fairly

    4. No Access

      Book Chapter

      Pages 183-194

      On Popular Random Assignments

  7. Social Networks

    1. No Access

      Book Chapter

      Pages 195-206

      Scheduling a Cascade with Opposing Influences

    2. No Access

      Book Chapter

      Pages 207-218

      Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games

    3. No Access

      Book Chapter

      Pages 219-230

      Inefficiency of Games with Social Context

  8. Mechanism Design

    1. No Access

      Book Chapter

      Pages 231-242

      Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines

previous Page of 2