Advertisement

Algorithmic Game Theory

First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings

  • Burkhard Monien
  • Ulf-Peter Schroeder

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Session 1: Routing and Scheduling I

  4. Session 2: Markets

    1. Shuchi Chawla, Tim Roughgarden
      Pages 70-82
    2. Moshe Babaioff, Patrick Briest, Piotr Krysta
      Pages 83-94
    3. Pavlos S. Efraimidis, Lazaros Tsavlidis
      Pages 95-108
  5. Session 3: Routing and Scheduling II

    1. Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis
      Pages 121-132
    2. Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson
      Pages 133-144
    3. Rainer Feldmann, Marios Mavronicolas, Andreas Pieris
      Pages 145-157
    4. Matthias Englert, Thomas Franke, Lars Olbrich
      Pages 158-169
  6. Session 4: Mechanism Design

    1. Richard Cole, Shahar Dobzinski, Lisa Fleischer
      Pages 170-181
    2. Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál
      Pages 182-193
    3. Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
      Pages 194-205
  7. Session 5: Potpourri of Games

    1. Nadine Baumann, Sebastian Stiller
      Pages 218-229
    2. Ulrich Faigle, Britta Peis
      Pages 230-241
    3. Arndt von Schemde, Bernhard von Stengel
      Pages 242-254
    4. Oren Ben-Zwi, Amir Ronen
      Pages 255-266
  8. Session 6: Solution Concepts

    1. Sébastien Hémon, Michel de Rougemont, Miklos Santha
      Pages 267-278
    2. Felix Brandt, Felix Fischer
      Pages 291-302
    3. Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth
      Pages 303-314
  9. Session 7: Cost Sharing

    1. Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
      Pages 327-336
    2. Niv Buchbinder, Liane Lewin-Eytan, Joseph (Seffi) Naor, Ariel Orda
      Pages 337-349
    3. Yvonne Bleischwitz, Florian Schoppmann
      Pages 350-361
    4. Reinhard Selten, Sabine Pittnauer, Martin Hohnisch
      Pages E1-E1
  10. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. 

The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing.

Keywords

algorithmic game theory algorithms anonymity approximation algorithms combinatorial optimization competitive auctions cooperative game theory decision making economic models equilibria algorithms game theory graphical games market analysis scheduling

Editors and affiliations

  • Burkhard Monien
    • 1
  • Ulf-Peter Schroeder
    • 1
  1. 1.Institut für InformatikUniversität PaderbornPaderbornGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-79309-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-79308-3
  • Online ISBN 978-3-540-79309-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site