Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings

Author:   Berthold Vöcking
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   2013 ed.
Volume:   8146
ISBN:  

9783642413919


Pages:   271
Publication Date:   23 September 2013
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $131.97 Quantity:  
Add to Cart

Share |

Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings


Add your own review!

Overview

Full Product Details

Author:   Berthold Vöcking
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2013 ed.
Volume:   8146
Dimensions:   Width: 15.50cm , Height: 1.50cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9783642413919


ISBN 10:   3642413919
Pages:   271
Publication Date:   23 September 2013
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

The Complexity of Fully Proportional Representation for Single-Crossing Electorates.- New Results on Equilibria in Strategic Candidacy.- Plurality Voting with Truth-Biased Agents.- Reliability Weighted Voting Games.- The Power of Mediation in an Extended El Farol Game.- Friend of My Friend: Network Formation with Two-Hop Benefit.- Load Rebalancing Games in Dynamic Systems with Migration Costs.- Stochastic Congestion Games with Risk-Averse Players.- Congestion Games with Player-Specific Costs Revisited.- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information.- Anti-coordination Games and Stable Graph Colorings.- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.- Cooperative Equilibria in Iterated Social Dilemmas.- Symmetries of Quasi-Values.- Dividing Connected Chores Fairly.- On Popular Random Assignments.- Scheduling a Cascade with Opposing Influences.- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.- Inefficiency of Games with Social Context.- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.- Imperfect Best-Response Mechanisms.- Pricing Ad Slots with Consecutive Multi-unit Demand.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List