Algorithmic Game Theory: First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedin: Fi by Burkhard MonienAlgorithmic Game Theory: First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedin: Fi by Burkhard Monien

Algorithmic Game Theory: First International Symposium, Sagt 2008, Paderborn, Germany, April 30…

byBurkhard MonienEditorUlf-Peter Schroeder

Paperback | April 25, 2008

Pricing and Purchase Info

$150.50

Earn 753 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the proceedings of the First International Symposium on Algorithmic Game Theory. It covers routing and scheduling, markets, mechanism design, a potpourri of games, solution concepts, and cost sharing.

Title:Algorithmic Game Theory: First International Symposium, Sagt 2008, Paderborn, Germany, April 30…Format:PaperbackDimensions:363 pages, 23.5 × 15.5 × 1.73 inPublished:April 25, 2008Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540793089

ISBN - 13:9783540793083

Look for similar items by category:

Reviews

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 Stochastic 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.