Algorithmic Game Theory

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

  • Giuseppe Persiano
Conference proceedings SAGT 2011

DOI: 10.1007/978-3-642-24829-0

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

Table of contents (28 papers)

  1. Front Matter
  2. Invited Talks

  3. Session 1: Auctions and Advertising

    1. Repeated Budgeted Second Price Ad Auction
      Asaph Arnon, Yishay Mansour
      Pages 7-18
    2. Prompt Mechanism for Ad Placement over Time
      Yossi Azar, Ety Khaitsin
      Pages 19-30
    3. The Multiple Attribution Problem in Pay-Per-Conversion Advertising
      Patrick Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee
      Pages 31-43
    4. On Communication Protocols That Compute Almost Privately
      Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan
      Pages 44-56
  4. Session 2: Quality of Solutions

    1. Dynamic Inefficiency: Anarchy without Stability
      Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal
      Pages 57-68
    2. Throw One’s Cake — and Eat It Too
      Orit Arzi, Yonatan Aumann, Yair Dombb
      Pages 69-80
    3. The Price of Optimum in a Matching Game
      Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Pages 81-92
    4. Pareto Optimality in Coalition Formation
      Haris Aziz, Felix Brandt, Paul Harrenstein
      Pages 93-104
  5. Session 3: Externalities

    1. Externalities among Advertisers in Sponsored Search
      Dimitris Fotakis, Piotr Krysta, Orestis Telelis
      Pages 105-116
    2. Peer Effects and Stability in Matching Markets
      Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman
      Pages 117-129
  6. Session 4: Mechanism Design

    1. Scheduling without Payments
      Elias Koutsoupias
      Pages 143-153
    2. Combinatorial Agency of Threshold Functions
      Shaili Jain, David C. Parkes
      Pages 154-165
    3. A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
      Navendu Jain, Ishai Menache, Joseph (Seffi) Naor, Jonathan Yaniv
      Pages 178-189
  7. Session 5: Complexity

    1. Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
      Panagiota N. Panagopoulou, Paul G. Spirakis
      Pages 190-199
    2. Complexity of Rational and Irrational Nash Equilibria
      Vittorio Bilò, Marios Mavronicolas
      Pages 200-211

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

  • 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