Algorithmic Game Theory: First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings / Edition 1

Algorithmic Game Theory: First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings / Edition 1

by Burkhard Monien
     
 

ISBN-10: 3540793089

ISBN-13: 9783540793083

Pub. Date: 05/28/2008

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008.

The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and

…  See more details below

Overview

This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008.

The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing.

Product Details

ISBN-13:
9783540793083
Publisher:
Springer Berlin Heidelberg
Publication date:
05/28/2008
Series:
Lecture Notes in Computer Science / Information Systems and Applications, incl. Internet/Web, and HCI Series, #4997
Edition description:
2008
Pages:
363
Product dimensions:
6.10(w) x 9.00(h) x 0.90(d)

Table of Contents

Invited Talks.- The Search for Equilibrium Concepts.- Experimental Results on the Process of Goal Formation and Aspiration Adaptation.- Approximate Equilibria for Strategic Two Person Games.- Session 1: Routing and Scheduling I.- The Influence of Link Restrictions on (Random) Selfish Routing.- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy.- The Price of Anarchy on Uniformly Related Machines Revisited.- Approximate Strong Equilibrium in Job Scheduling Games.- Session 2: Markets.- Bertrand Competition in Networks.- On the Approximability of Combinatorial Exchange Problems.- Window-Games between TCP Flows.- Price Variation in a Bipartite Exchange Network.- Session 3: Routing and Scheduling II.- Atomic Congestion Games: Fast, Myopic and Concurrent.- Frugal Routing on Wireless Ad-Hoc Networks.- Facets of the Fully Mixed Nash Equilibrium Conjecture.- Sensitivity of Wardrop Equilibria.- Session 4: Mechanism Design.- Prompt Mechanisms for Online Auctions.- A Truthful Mechanism for Offline Ad Slot Scheduling.- Alternatives to Truthfulness Are Hard to Recognize.- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity.- Session 5: Potpourri of Games.- The Price of Anarchy of a Network Creation Game with Exponential Payoff.- A Hierarchical Model for Cooperative Games.- Strategic Characterization of the Index of an Equilibrium.- The Local and Global Price of Anarchy of Graphical Games.- Session 6: Solution Concepts.- Approximate Nash Equilibria for Multi-player Games.- Subjective vs. Objective Reality — The Risk of Running Late.- On the Hardness and Existence of Quasi-Strict Equilibria.- The Price of Shastic Anarchy.- Session 7: Cost Sharing.- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems.- Is Shapley Cost Sharing Optimal?.- Non-cooperative Cost Sharing Games Via Subsidies.- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location.- Experimental Results on the Process of Goal Formation and Aspiration Adaptation.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >