Algorithmic Game Theory
Springer Berlin (Verlag)
978-3-642-41391-9 (ISBN)
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.
Erscheint lt. Verlag | 23.9.2013 |
---|---|
Reihe/Serie | Information Systems and Applications, incl. Internet/Web, and HCI | Lecture Notes in Computer Science |
Zusatzinfo | XII, 271 p. 29 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 438 g |
Themenwelt | Informatik ► Office Programme ► Outlook |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Schlagworte | advertisement auction • Algorithmen • influence maximization • Nash Equilibria • network robustness • weighted voting game |
ISBN-10 | 3-642-41391-9 / 3642413919 |
ISBN-13 | 978-3-642-41391-9 / 9783642413919 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich