Skip to main content
SpringerLink
Log in
Book cover

Algorithmic Game Theory

8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28-30, 2015. Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Martin Hoefer

    1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    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 9347)

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 2015.

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 (29 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Matching Under Preferences

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints

      • Naoyuki Kamiyama
      Pages 3-14

    3. Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability

      • Ágnes Cseh, David F. Manlove
      Pages 15-26

    4. Pareto Optimal Matchings in Many-to-Many Markets with Ties

      • Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos et al.
      Pages 27-39

  3. Cost Sharing

    1. Front Matter

      Pages 41-41
      Download chapter PDF

    2. Cost-Sharing Models in Participatory Sensing

      • Georgios Birmpas, Costas Courcoubetis, Ioannis Giotis, Evangelos Markakis
      Pages 43-56

    3. Further Results on Capacitated Network Design Games

      • Thomas Erlebach, Matthew Radoja
      Pages 57-68

    4. Cost-Sharing Scheduling Games on Restricted Unrelated Machines

      • Guy Avni, Tami Tamir
      Pages 69-81

  4. Mechanism Design and Social Choice

    1. Front Matter

      Pages 83-83
      Download chapter PDF

    2. Efficient Money Burning in General Domains

      • Dimitris Fotakis, Dimitris Tsipras, Christos Tzamos, Emmanouil Zampetakis
      Pages 85-97

    3. Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design

      • Khaled Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani
      Pages 98-109

    4. Equilibria of Plurality Voting: Lazy and Truth-Biased Voters

      • Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron
      Pages 110-122

  5. Auctions

    1. Front Matter

      Pages 123-123
      Download chapter PDF

    2. The Combinatorial World (of Auctions) According to GARP

      • Shant Boodaghians, Adrian Vetta
      Pages 125-136

    3. Auction Design with a Revenue Target

      • Paul W. Goldberg, Bo Tang
      Pages 137-149

    4. Algorithmic Signaling of Features in Auction Design

      • Shaddin Dughmi, Nicole Immorlica, Ryan O’Donnell, Li-Yang Tan
      Pages 150-162

  6. Networking

    1. Front Matter

      Pages 163-163
      Download chapter PDF

    2. On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources

      • George Christodoulou, Alkmini Sgouritsa, Bo Tang
      Pages 165-177

    3. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

      • Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
      Pages 178-189
Back to top

Other volumes

  1. Algorithmic Game Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 8th International Symposium on Algorithmic Game Theory, SAGT 2015, held in Saarbrücken, Germany, in September 2015.

The 22 full papers presented together with one extended abstract and 6 brief announcements were carefully reviewed and selected from 63 submissions. They cover various important aspects of algorithmic game theory, such as matching under preferences; cost sharing; mechanism design and social choice; auctions; networking; routing and fairness; and equilibrium computation.

Editors and Affiliations

  • Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Martin Hoefer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation