Algorithmic Game Theory Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Mavronicolas, Marios (Επιμελητής έκδοσης), Papadopoulou, Vicky G. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Σειρά: Lecture Notes in Computer Science, 5814
• Θέματα: Computer science.; Numerical analysis.; Computers.; Computer simulation.; Application software.; Computers and civilization.; E-commerce.; Computer Science.; Simulation and Modeling.; Computer Applications.; Computers and Society.; e-Commerce/e-business.; Models and Principles.; Numeric Computing.

This book constitutes the refereed proceedings of the Second International Symposium on Algorithmic Game Theory, SAGT 2009, held in Paphos, Cyprus, in October 2009. The 29 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 55 submissions. The pape...

Πίνακας περιεχομένων:

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