Algorithmic Game Theory

First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings
2008
ISBN: 978-3-540-79308-3
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 4997, 363 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 581 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Schroeder, Ulf-Peter

Monien, Burkhard

Fachgebiete

• Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein Soziale und ethische Aspekte der EDV
• Mathematik | Informatik Mathematik Operations Research Spieltheorie
• Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
• Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie

Inhaltsverzeichnis

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