- 5 Ergebnisse
Kleinster Preis: € 47,62, größter Preis: € 69,29, Mittelwert: € 54,83
1
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings Spyros Kontogiannis Editor
Bestellen
bei BarnesandNoble.com
€ 54,99
Bestellengesponserter Link

Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings Spyros Kontogiannis Editor - neues Buch

2010, ISBN: 9783642161698

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 pape… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings: 6386 (Lecture Notes in Computer Science, 6386)
Bestellen
bei amazon.co.uk
£ 40,52
(ca. € 47,62)
Versand: € 5,641
Bestellengesponserter Link
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings: 6386 (Lecture Notes in Computer Science, 6386) - Taschenbuch

2010, ISBN: 9783642161698

Editor: Kontogiannis, Spyros, Editor: Koutsoupias, Elias, Editor: Spirakis, Paul, Springer, Paperback, Auflage: 2010, 367 Seiten, Publiziert: 2010-10-06T00:00:01Z, Produktgruppe: Book, He… Mehr…

Gebraucht, wie neu. Versandkosten:Usually dispatched within 13 to 14 days. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.64) BOOKS etc
3
Algorithmic Game Theory - Kontogiannis, Spyros|Koutsoupias, Elias|Spirakis, Paul
Bestellen
bei AbeBooks.de
€ 48,74
Versand: € 0,001
Bestellengesponserter Link
Kontogiannis, Spyros|Koutsoupias, Elias|Spirakis, Paul:
Algorithmic Game Theory - Taschenbuch

2010

ISBN: 3642161693

[EAN: 9783642161698], Neubuch, [PU: Springer Berlin Heidelberg], DATENVERARBEITUNG ANWENDUNGEN MATHEMATIK, STATISTIK E-BUSINESS ELECTRONIC COMMERCE - E-COMMERCE E-VENTURE INTERNET NET ECO… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
4
Bestellen
bei AbeBooks.de
€ 69,29
Versand: € 37,351
Bestellengesponserter Link
Koutsoupias, Elias:
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings (Lecture Notes in Computer Science, 6386) - Taschenbuch

2010, ISBN: 3642161693

[EAN: 9783642161698], Neubuch, [PU: Springer], Clean and crisp and new!, Books

NEW BOOK. Versandkosten: EUR 37.35 Welcome Back Books, Toledo, OH, U.S.A. [64434632] [Rating: 4 (von 5)]
5
Algorithmic Game Theory
Bestellen
bei Springer.com
€ 53,49
Versand: € 0,001
Bestellengesponserter Link
Algorithmic Game Theory - neues Buch

ISBN: 9783642161698

There is currently no description available, Springer

Nr. 978-3-642-16169-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings: 6386 (Lecture Notes in Computer Science, 6386)

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.

Detailangaben zum Buch - Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings: 6386 (Lecture Notes in Computer Science, 6386)


EAN (ISBN-13): 9783642161698
ISBN (ISBN-10): 3642161693
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer
358 Seiten
Gewicht: 0,566 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-05-18T15:19:12+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-02-15T06:48:07+01:00 (Berlin)
ISBN/EAN: 9783642161698

ISBN - alternative Schreibweisen:
3-642-16169-3, 978-3-642-16169-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: kontogiannis, spyr, spira, spir, paul kont, amos und
Titel des Buches: proceedings third symposium, third international theory, game over, proceedings the third international, lecture notes computer science, das sagt mir was, athens, algorithmic game theory


Daten vom Verlag:

Autor/in: Spyros Kontogiannis; Elias Koutsoupias; Paul Spirakis
Titel: Lecture Notes in Computer Science; Information Systems and Applications, incl. Internet/Web, and HCI; Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings
Verlag: Springer; Springer Berlin
359 Seiten
Erscheinungsjahr: 2010-10-06
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 359 p. 25 illus.

BC; Hardcover, Softcover / Informatik, EDV/Anwendungs-Software; Computermodellierung und -simulation; Verstehen; Braess's paradox; Hedonic games; Nash equilibrium; algorithmic game theory; auctions; coalition formation; congestion games; dynamic flows; equilibria; game theory; marketing models; price of anarchy; routing games; selfish routing; Computer Modelling; e-Commerce and e-Business; Theory of Computation; Models of Computation; Computers and Society; Numerical Analysis; Computer-Anwendungen in den Sozial- und Verhaltenswissenschaften; E-Commerce: geschäftliche Aspekte; Theoretische Informatik; Digital- und Informationstechnologien: soziale und ethische Aspekte; Numerische Mathematik; EA

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 BottleneckCongestion Games.- Minimal Subsidies in Expense Sharing Games.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783540360766 Algorithmic Number Theory (Springer)


< zum Archiv...