1. SAGT 2008: Paderborn, Germany

Burkhard Monien, Ulf-Peter Schroeder (Eds.): Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings. Lecture Notes in Computer Science 4997 Springer 2008, ISBN 978-3-540-79308-3 BibTeX

Invited Talks

Christos H. Papadimitriou:
The Search for Equilibrium Concepts. 1-3
Electronic Edition (link) BibTeX
Reinhard Selten:
Experimental Results on the Process of Goal Formation and Aspiration Adaptation. 4
Electronic Edition (link) BibTeX
Paul G. Spirakis:
Approximate Equilibria for Strategic Two Person Games. 5-21
Electronic Edition (link) BibTeX

Martin Hoefer, Alexander Souza:
The Influence of Link Restrictions on (Random) Selfish Routing. 22-32
Electronic Edition (link) BibTeX
Dimitris Fotakis:
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy. 33-45
Electronic Edition (link) BibTeX
Leah Epstein, Rob van Stee:
The Price of Anarchy on Uniformly Related Machines Revisited. 46-57
Electronic Edition (link) BibTeX
Michal Feldman, Tami Tamir:
Approximate Strong Equilibrium in Job Scheduling Games. 58-69
Electronic Edition (link) BibTeX

Shuchi Chawla, Tim Roughgarden:
Bertrand Competition in Networks. 70-82
Electronic Edition (link) BibTeX
Moshe Babaioff, Patrick Briest, Piotr Krysta:
On the Approximability of Combinatorial Exchange Problems. 83-94
Electronic Edition (link) BibTeX
Pavlos Efraimidis, Lazaros Tsavlidis:
Window-Games between TCP Flows. 95-108
Electronic Edition (link) BibTeX
Ronen Gradwohl:
Price Variation in a Bipartite Exchange Network. 109-120
Electronic Edition (link) BibTeX

Richard Cole, Shahar Dobzinski, Lisa Fleischer:
Prompt Mechanisms for Online Auctions. 170-181
Electronic Edition (link) BibTeX
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál:
A Truthful Mechanism for Offline Ad Slot Scheduling. 182-193
Electronic Edition (link) BibTeX
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre:
Alternatives to Truthfulness Are Hard to Recognize. 194-205
Electronic Edition (link) BibTeX
Markus Bläser, Elias Vicari:
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity. 206-217
Electronic Edition (link) BibTeX

Nadine Baumann, Sebastian Stiller:
The Price of Anarchy of a Network Creation Game with Exponential Payoff. 218-229
Electronic Edition (link) BibTeX
Ulrich Faigle, Britta Peis:
A Hierarchical Model for Cooperative Games. 230-241
Electronic Edition (link) BibTeX
Arndt von Schemde, Bernhard von Stengel:
Strategic Characterization of the Index of an Equilibrium. 242-254
Electronic Edition (link) BibTeX
Oren Ben-Zwi, Amir Ronen:
The Local and Global Price of Anarchy of Graphical Games. 255-266
Electronic Edition (link) BibTeX

Sébastien Hémon, Michel de Rougemont, Miklos Santha:
Approximate Nash Equilibria for Multi-player Games. 267-278
Electronic Edition (link) BibTeX
Amos Fiat, Hila Pochter:
Subjective vs.Objective Reality - The Risk of Running Late. 279-290
Electronic Edition (link) BibTeX
Felix Brandt, Felix A. Fischer:
On the Hardness and Existence of Quasi-Strict Equilibria. 291-302
Electronic Edition (link) BibTeX
Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth:
The Price of Stochastic Anarchy. 303-314
Electronic Edition (link) BibTeX

Janina Brenner, Guido Schäfer:
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. 315-326
Electronic Edition (link) BibTeX
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Is Shapley Cost Sharing Optimal? 327-336
Electronic Edition (link) BibTeX
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative Cost Sharing Games Via Subsidies. 337-349
Electronic Edition (link) BibTeX
Yvonne Bleischwitz, Florian Schoppmann:
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location. 350-361
Electronic Edition (link) BibTeX