Journal: Theory Comput. Syst.

Volume 63, Issue 1

1 -- 0. A Message from the Springer Editorial Team
2 -- 3Martin Gairing, Rahul Savani. Preface to the Special Issue on Algorithmic Game Theory
4 -- 25George Christodoulou 0001, Stefano Leonardi, Alkmini Sgouritsa. Designing Cost-Sharing Methods for Bayesian Games
26 -- 53Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu. Logarithmic Query Complexity for Approximate Nash Computation in Large Games
54 -- 89Pieter Kleer, Guido Schäfer. The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games
90 -- 113Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini. Price of Anarchy for Highly Congested Routing Games in Parallel Networks
114 -- 127Ioannis Caragiannis, Angelo Fanelli 0001. An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
128 -- 149Ágnes Cseh, Robert W. Irving, David F. Manlove. The Stable Roommates Problem with Short Lists
150 -- 174Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach. Analyzing Power in Weighted Voting Games with Super-Increasing Weights