Buch, Englisch, Band 5814, 359 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 569 g
Buch, Englisch, Band 5814, 359 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 569 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-642-04644-5
Verlag: Springer
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie
- Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein Soziale und ethische Aspekte der EDV
- Mathematik | Informatik Mathematik Operations Research Spieltheorie
- Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
- Mathematik | Informatik EDV | Informatik Professionelle Anwendung Computersimulation & Modelle, 3-D Graphik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
Monotonicity in Mechanism Design.- Computational Aspects of Equilibria.- A Modular Approach to Roberts’ Theorem.- Characterizing Incentive Compatibility for Convex Valuations.- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.- Partition Equilibrium.- Better with Byzantine: Manipulation-Optimal Mechanisms.- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design.- Sequential Pivotal Mechanisms for Public Project Problems.- Characterizing the Existence of Potential Functions in Weighted Congestion Games.- Free-Riding and Free-Labor in Combinatorial Agency.- The Cost of Stability in Coalitional Games.- Non-clairvoyant Scheduling Games.- The Balloon Popping Problem Revisited: Lower and Upper Bounds.- Anarchy, Stability, and Utopia: Creating Better Matchings.- Equilibria in Dynamic Selfish Routing.- Stochastic Stability in Internet Router Congestion Games.- Nash Dynamics in Constant Player and Bounded Jump Congestion Games.- Price of Stability in Survivable Network Design.- Games with Congestion-Averse Utilities.- A New Derandomization of Auctions.- The Computational Complexity of Weak Saddles.- Learning and Approximating the Optimal Strategy to Commit To.- Doing Good with Spam Is Hard.- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.- On the Complexity of Iterated Weak Dominance in Constant-Sum Games.- Swap Bribery.- Performances of One-Round Walks in Linear Congestion Games.- Nash Equilibria and the Price of Anarchy for Flows over Time.- Bayesian Auctions with Friends and Foes.- On Equilibria for ADM Minimization Games.