Skip to main content
SpringerLink
Log in

Algorithmic Game Theory

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Giuseppe Persiano

    1. Dipartimento di Informatica ed Applicazioni Università di Salerno, Fisciano, Italy

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

Part of the book sub series: Information Systems and Applications, incl. Internet/Web, and HCI (LNISA)

Included in the following conference series:

Conference proceedings info: SAGT 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Computational Game Theory

      • Bruno Codenotti
      Pages 1-1

    2. Computation and Incentives of Competitive Equilibria in a Matching Market

      • Ning Chen, Xiaotie Deng
      Pages 2-6

  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

    3. Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities

      • Oskar Skibski
      Pages 130-142

  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. Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

      • Lisa Fleischer, Zhenghui Wang
      Pages 166-177

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

Other volumes

  1. Algorithmic Game Theory

Keywords

About this book

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.

Editors and Affiliations

  • Dipartimento di Informatica ed Applicazioni Università di Salerno, Fisciano, Italy

    Giuseppe Persiano

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation