Theory of Computing Systems

A Message from the Springer Editorial Team

Preface to the Special Issue on Algorithmic Game Theory

Martin Gairing, Rahul Savani

Designing Cost-Sharing Methods for Bayesian Games

George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa

Logarithmic Query Complexity for Approximate Nash Computation in Large Games

Paul W. Goldberg, Francisco J. Marmolejo-Cossío, Zhiwei Steven Wu

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games

Pieter Kleer, Guido Schäfer

Price of Anarchy for Highly Congested Routing Games in Parallel Networks

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling

Ioannis Caragiannis, Angelo Fanelli

The Stable Roommates Problem with Short Lists

Ágnes Cseh, Robert W. Irving, David F. Manlove

Analyzing Power in Weighted Voting Games with Super-Increasing Weights

Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach