Overview

Full Product Details

Author:   Marios Mavronicolas ,  Maria Papadoupoulou
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2009 ed.
Volume:   5814
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   0.569kg
ISBN:  

9783642046445

ISBN 10:   3642046444
Pages:   359
Publication Date:   23 September 2009
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions