Algorithmic Game Theory

Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings

  • Marios Mavronicolas
  • Vicky G. Papadopoulou
Conference proceedings SAGT 2009
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5814)

Table of contents

  1. Front Matter
  2. Dov Monderer
    Pages 1-1
  3. Mihalis Yannakakis
    Pages 2-13
  4. Shahar Dobzinski, Noam Nisan
    Pages 14-23
  5. André Berger, Rudolf Müller, Seyed Hossein Naeemi
    Pages 24-35
  6. Clemens Thielen, Sven O. Krumke
    Pages 36-47
  7. Michal Feldman, Moshe Tennenholtz
    Pages 48-59
  8. Abraham Othman, Tuomas Sandholm
    Pages 60-71
  9. Krzysztof R. Apt, Arantza Estévez-Fernández
    Pages 85-96
  10. Tobias Harks, Max Klimm, Rolf H. Möhring
    Pages 97-108
  11. Moshe Babaioff, Michal Feldman, Noam Nisan
    Pages 109-121
  12. Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii Pasechnik, Michael Zuckerman, Jörg Rothe et al.
    Pages 122-134
  13. Christoph Dürr, Kim Thang Nguyen
    Pages 135-146
  14. Hyunwoo Jung, Kyung-Yong Chwa
    Pages 147-158
  15. Elliot Anshelevich, Sanmay Das, Yonatan Naamad
    Pages 159-170
  16. Elliot Anshelevich, Satish Ukkusuri
    Pages 171-182
  17. Christine Chung, Evangelia Pyrga
    Pages 183-195
  18. Tanmoy Chakraborty, Sanjeev Khanna
    Pages 196-207
  19. Elliot Anshelevich, Bugra Caskurlu
    Pages 208-219

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Second International Symposium on Algorithmic Game Theory, SAGT 2009, held in Paphos, Cyprus, in October 2009.

The 29 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 55 submissions. The papers are intended to cover all important areas such as solution concepts, game classes, computation of equilibria and market equilibria, algorithmic mechanism design, automated mechanism design, convergence and learning in games, complexity classes in game theory, algorithmic aspects of fixed-point theorems, mechanisms, incentives and coalitions, cost-sharing algorithms, computational problems in economics, finance, decision theory and pricing, computational social choice, auction algorithms, price of anarchy and its relatives, representations of games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and network design and formation games and game-theoretic approaches to networking problems.

Keywords

Internet algorithmic game theory approximation auctions complexity congestion games decision making economic models equilibria game theory marketing models minimization games nash equilibrium scheduling games selfish routing

Editors and affiliations

  • Marios Mavronicolas
    • 1
  • Vicky G. Papadopoulou
    • 2
  1. 1.Department of Computer ScienceUniversity of CyprusNicosiaCyprus
  2. 2.Department of Computer Science and EngineeringEuropean University CyprusNicosiaCyprus

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-04645-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-04644-5
  • Online ISBN 978-3-642-04645-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book