Skip to main content
SpringerLink
Log in

Algorithmic Game Theory

9th International Symposium, SAGT 2016, Liverpool, UK, September 19–21, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Martin Gairing

    1. University of Liverpool, Liverpool, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rahul Savani

    1. University of Liverpool, Liverpool, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9928)

Part of the book sub series: Information Systems and Applications, incl. Internet/Web, and HCI (LNISA)

Included in the following conference series:

Conference proceedings info: SAGT 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (26 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Computational Aspects of Games

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Logarithmic Query Complexity for Approximate Nash Computation in Large Games

      • Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu
      Pages 3-14

    3. Lipschitz Continuity and Approximate Equilibria

      • Argyrios Deligkas, John Fearnley, Paul Spirakis
      Pages 15-26

    4. The Parallel Complexity of Coloring Games

      • Guillaume Ducoffe
      Pages 27-39

    5. Complexity and Optimality of the Best Response Algorithm in Random Potential Games

      • Stéphane Durand, Bruno Gaujal
      Pages 40-51

    6. Deciding Maxmin Reachability in Half-Blind Stochastic Games

      • Edon Kelmendi, Hugo Gimbert
      Pages 52-63

    7. The Big Match in Small Space

      • Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
      Pages 64-76

    8. History-Independent Distributed Multi-agent Learning

      • Amos Fiat, Yishay Mansour, Mariano Schain
      Pages 77-89

  3. Congestion Games and Networks

    1. Front Matter

      Pages 91-91
      Download chapter PDF

    2. On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games

      • Vittorio Bilò
      Pages 93-104

    3. Efficiency of Equilibria in Uniform Matroid Congestion Games

      • Jasper de Jong, Max Klimm, Marc Uetz
      Pages 105-116

    4. On the Price of Anarchy of Highly Congested Nonatomic Network Games

      • Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
      Pages 117-128

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

      • Pieter Kleer, Guido Schäfer
      Pages 129-140

    6. On Selfish Creation of Robust Networks

      • Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn
      Pages 141-152

    7. Dynamic Resource Allocation Games

      • Guy Avni, Thomas A. Henzinger, Orna Kupferman
      Pages 153-166

  4. Matching and Voting

    1. Front Matter

      Pages 167-167
      Download chapter PDF

    2. Analyzing Power in Weighted Voting Games with Super-Increasing Weights

      • Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick
      Pages 169-181

    3. Strong and Weak Acyclicity in Iterative Voting

      • Reshef Meir
      Pages 182-194

    4. Stable Matching with Uncertain Linear Preferences

      • Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
      Pages 195-206
Back to top

Other volumes

  1. Algorithmic Game Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 9th International Symposium on Algorithmic Game Theory, SAGT 2016, held in Liverpool, UK, in September 2016.The 26 full papers presented together with  2 one-page abstracts were carefully reviewed and selected from 62 submissions.

The accepted submissions cover various important aspects
of algorithmic game theory such as computational aspects of games, congestion games and networks, matching and voting, auctions and markets, and mechanism design.





Editors and Affiliations

  • University of Liverpool, Liverpool, United Kingdom

    Martin Gairing, Rahul Savani

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation