Algorithmic Game Theory

4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings

  • Giuseppe Persiano
Conference proceedings SAGT 2011
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)

Table of contents

  1. Session 5: Complexity

    1. Krzysztof R. Apt, Evangelos Markakis
      Pages 212-223
  2. Session 6: Network Games

    1. Michael Brautbar, Michael Kearns
      Pages 224-235
    2. Long Tran-Thanh, Maria Polukarov, Archie Chapman, Alex Rogers, Nicholas R. Jennings
      Pages 236-253
    3. Pascal Lenzner
      Pages 254-265
  3. Session 7: Pricing

    1. Eyal Gofer, Yishay Mansour
      Pages 266-277
    2. Elliot Anshelevich, Ameya Hate, Koushik Kar
      Pages 278-289
  4. Session 8: Routing Games

    1. Roee Engelberg, Michael Schapira
      Pages 290-301
    2. Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer
      Pages 302-313
    3. Evdokia Nikolova, Nicolas E. Stier-Moses
      Pages 314-325
  5. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Fourth International Symposium on Algorithmic Game Theory, SAGT 2011, held in Amalfi, Italy, in October 2011. The 26 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on auctions and advertising, quality of solutions, externalities, mechanism design, complexity, network games, pricing, as well as routing games.

Keywords

approximate privacy nash equilibrium network pricing price of stability selfish routing

Editors and affiliations

  • Giuseppe Persiano
    • 1
  1. 1.Dipartimento di Informatica ed Applicazioni Università di SalernoFiscianoItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-24829-0
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-24828-3
  • Online ISBN 978-3-642-24829-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349