Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithmic Game Theory
  • Produktbild: Algorithmic Game Theory

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

Aus der Reihe Information Systems and Applications, incl. Internet/Web, and HCI

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.04.2008

Abbildungen

XI, 363 p.

Herausgeber

Burkhard Monien + weitere

Verlag

Springer Berlin

Seitenzahl

363

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

581 g

Sprache

Englisch

ISBN

978-3-540-79308-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.04.2008

Abbildungen

XI, 363 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

363

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

581 g

Sprache

Englisch

ISBN

978-3-540-79308-3

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Game Theory
  • Produktbild: Algorithmic Game Theory
  • 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.