Special Issue on Algorithmic Game Theory (SAGT 2016)

ISSN: 1432-4350 (Print) 1433-0490 (Online)

In this topical collection (8 articles)

  1. EditorialNotes

    Preface to the Special Issue on Algorithmic Game Theory

    Martin Gairing, Rahul Savani Pages 2-3
    Download PDF (267KB) View Article

  2. OriginalPaper

    Designing Cost-Sharing Methods for Bayesian Games

    George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa Pages 4-25
    Download PDF (756KB) View Article

  3. OriginalPaper

    Logarithmic Query Complexity for Approximate Nash Computation in Large Games

    Paul W. Goldberg, Francisco J. Marmolejo-Cossío… Pages 26-53
    Download PDF (1352KB) View Article

  4. OriginalPaper

    The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games

    Pieter Kleer, Guido Schäfer Pages 54-89
    Download PDF (1194KB) View Article

  5. OriginalPaper

    Price of Anarchy for Highly Congested Routing Games in Parallel Networks

    Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini Pages 90-113
    Download PDF (948KB) View Article

  6. OriginalPaper

    An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling

    Ioannis Caragiannis, Angelo Fanelli Pages 114-127
    Download PDF (450KB) View Article

  7. OriginalPaper

    The Stable Roommates Problem with Short Lists

    Ágnes Cseh, Robert W. Irving, David F. Manlove Pages 128-149
    Download PDF (878KB) View Article

  8. OriginalPaper

    Analyzing Power in Weighted Voting Games with Super-Increasing Weights

    Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach Pages 150-174
    Download PDF (966KB) View Article