Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2009

Algorithmic Game Theory

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

Editors:

  1. Marios Mavronicolas

    1. Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vicky G. Papadopoulou

    1. Department of Computer Science and Engineering, European University Cyprus, Nicosia, Cyprus

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SAGT: International Symposium on Algorithmic Game Theory

Conference proceedings info: SAGT 2009.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

This is a preview of subscription content, access via your institution.

Table of contents (31 papers)

  1. Front Matter

    PDF

  2. Monotonicity in Mechanism Design

    • Dov Monderer
    Pages 1-1

  3. Computational Aspects of Equilibria

    • Mihalis Yannakakis
    Pages 2-13

  4. A Modular Approach to Roberts’ Theorem

    • Shahar Dobzinski, Noam Nisan
    Pages 14-23

  5. Characterizing Incentive Compatibility for Convex Valuations

    • André Berger, Rudolf Müller, Seyed Hossein Naeemi
    Pages 24-35

  6. Truthful Mechanisms for Selfish Routing and Two-Parameter Agents

    • Clemens Thielen, Sven O. Krumke
    Pages 36-47

  7. Partition Equilibrium

    • Michal Feldman, Moshe Tennenholtz
    Pages 48-59

  8. Better with Byzantine: Manipulation-Optimal Mechanisms

    • Abraham Othman, Tuomas Sandholm
    Pages 60-71

  10. Sequential Pivotal Mechanisms for Public Project Problems

    • Krzysztof R. Apt, Arantza Estévez-Fernández
    Pages 85-96

  11. Characterizing the Existence of Potential Functions in Weighted Congestion Games

    • Tobias Harks, Max Klimm, Rolf H. Möhring
    Pages 97-108

  12. Free-Riding and Free-Labor in Combinatorial Agency

    • Moshe Babaioff, Michal Feldman, Noam Nisan
    Pages 109-121

  13. The Cost of Stability in Coalitional Games

    • Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii Pasechnik, Michael Zuckerman, Jörg Rothe et al.
    Pages 122-134

  14. Non-clairvoyant Scheduling Games

    • Christoph Dürr, Kim Thang Nguyen
    Pages 135-146

  15. The Balloon Popping Problem Revisited: Lower and Upper Bounds

    • Hyunwoo Jung, Kyung-Yong Chwa
    Pages 147-158

  16. Anarchy, Stability, and Utopia: Creating Better Matchings

    • Elliot Anshelevich, Sanmay Das, Yonatan Naamad
    Pages 159-170

  17. Equilibria in Dynamic Selfish Routing

    • Elliot Anshelevich, Satish Ukkusuri
    Pages 171-182

  18. Stochastic Stability in Internet Router Congestion Games

    • Christine Chung, Evangelia Pyrga
    Pages 183-195

  19. Nash Dynamics in Constant Player and Bounded Jump Congestion Games

    • Tanmoy Chakraborty, Sanjeev Khanna
    Pages 196-207

  20. Price of Stability in Survivable Network Design

    • Elliot Anshelevich, Bugra Caskurlu
    Pages 208-219
Back to top

Other Volumes

  1. Algorithmic Game Theory

Back to top

About this book

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.
Back to top

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
Back to top

Editors and Affiliations

  • Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    Marios Mavronicolas

  • Department of Computer Science and Engineering, European University Cyprus, Nicosia, Cyprus

    Vicky G. Papadopoulou

Back to top

Bibliographic Information

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

search

Navigation