Willkommen, schön sind Sie da!
Logo Ex Libris

Algorithmic Game Theory

  • Kartonierter Einband
  • 359 Seiten
(0) Erste Bewertung abgeben
Bewertungen & Rezensionen
Alle Bewertungen ansehen
Thepresentvolumewasdevotedto thethirdeditionofthe InternationalSym- sium on Algorithmic Game Theory (SAGT), an interdisciplinary s... Weiterlesen
83.35 CHF 66.70
Sie sparen CHF 16.65
Exemplar wird für Sie besorgt.
Kein Rückgaberecht!
Bestellung & Lieferung in eine Filiale möglich


Thepresentvolumewasdevotedto thethirdeditionofthe InternationalSym- sium on Algorithmic Game Theory (SAGT), an interdisciplinary scienti?c event intended to provide a forum for researchers as well as practitioners to exchange innovative ideas and to be aware of each other s e?orts and results. SAGT 2010 took place in Athens, on October 18 20, 2010. The present volume contains all contributed papers presented at SAGT 2010 together with the distinguished invited lectures of Amos Fiat (Tel-Aviv University, Israel), and Paul Goldberg (University of Liverpool, UK). The two invited papers are presented at the - ginning of the proceedings, while the regular papers follow in alphabetical order (by the authors names). In response to the call for papers, the Program Committee (PC) received 61 submissions.Amongthesubmissionswerefour paperswith atleastonecoauthor that was also a PC member of SAGT 2010. For these PC-coauthored papers, anindependent subcommittee (EliasKoutsoupias,PaulG. Spirakis,andXiaotie Deng) made the judgment, and eventually two of these papers were proposedfor inclusion in the Scienti?c Program. For the remaining 57 (non-PC-coauthored) papers, the PC of SAGT 2010 conducted a thorough evaluation (at least 3, and on average 3.9 reviews per paper) and electronic discussion, and eventually selected 26 papers for inclusion in the Scienti?c Program. An additional tutorial, Games Played in Physics , was also provided in SAGT 2010, courtesy of the academic research network Algogames (A??o?a????o) of the University of Patras.


This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Game Theory, SAGT 2010, held in Athens, Greece, in October 2010. The 28 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 61 submissions. The papers are intended to cover all important areas such as solution concepts, game classes, computation of equilibria and market equilibria, convergence and learning in games, complexity classes in game theory, algorithmic aspects of fixed-point theorems, mechanisms, incentives and coalitions, cost-sharing algorithms, computational problems in economics, finance, decision theory and pricing, computational social choice, auction algorithms, price of anarchy and its relatives, representations of games and their complexity, network formation on the internet, congestion, routing and network design and formation games, game-theoretic approaches to networking problems, and computational social choice.

When the Players Are Not Expectation Maximizers.- How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?.- A Simplex-Like Algorithm for Fisher Markets.- Nash Equilibria in Fisher Market.- Partition Equilibrium Always Exists in Resource Selection Games.- Mixing Time and Stationary Expected Social Welfare of Logit Dynamics.- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games.- On Nash-Equilibria of Approximation-Stable Games.- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.- On the Rate of Convergence of Fictitious Play.- On Learning Algorithms for Nash Equilibria.- On the Structure of Weakly Acyclic Games.- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium.- Responsive Lotteries.- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.- Computing Stable Outcomes in Hedonic Games.- A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It.- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements.- Complexity of Safe Strategic Voting.- Bottleneck Congestion Games with Logarithmic Price of Anarchy.- Single-Parameter Combinatorial Auctions with Partially Public Valuations.- On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms.- Braess's Paradox for Flows over Time.- The Price of Anarchy in Network Creation Games Is (Mostly) Constant.- Truthful Fair Division.- No Regret Learning in Oligopolies: Cournot vs. Bertrand.- On the Complexity of Pareto-optimal Nash and Strong Equilibria.- 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties.- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.- Minimal Subsidies in Expense Sharing Games.


Titel: Algorithmic Game Theory
Untertitel: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings
EAN: 9783642161698
ISBN: 978-3-642-16169-8
Format: Kartonierter Einband
Herausgeber: Springer, Berlin
Genre: Informatik
Anzahl Seiten: 359
Größe: H21mm x B235mm x T154mm
Jahr: 2010
Untertitel: Englisch
Auflage: 2010

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"