Abstract is missing.
- Logarithmic Query Complexity for Approximate Nash Computation in Large GamesPaul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu. 3-14 [doi]
- Lipschitz Continuity and Approximate EquilibriaArgyrios Deligkas, John Fearnley, Paul G. Spirakis. 15-26 [doi]
- The Parallel Complexity of Coloring GamesGuillaume Ducoffe . 27-39 [doi]
- Complexity and Optimality of the Best Response Algorithm in Random Potential GamesStéphane Durand, Bruno Gaujal. 40-51 [doi]
- Deciding Maxmin Reachability in Half-Blind Stochastic GamesEdon Kelmendi, Hugo Gimbert. 52-63 [doi]
- The Big Match in Small Space - (Extended Abstract)Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký. 64-76 [doi]
- History-Independent Distributed Multi-agent LearningAmos Fiat, Yishay Mansour, Mariano Schain. 77-89 [doi]
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion GamesVittorio Bilò. 93-104 [doi]
- Efficiency of Equilibria in Uniform Matroid Congestion GamesJasper de Jong, Max Klimm, Marc Uetz. 105-116 [doi]
- On the Price of Anarchy of Highly Congested Nonatomic Network GamesRiccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini. 117-128 [doi]
- The Impact of Worst-Case Deviations in Non-Atomic Network Routing GamesPieter Kleer, Guido Schäfer. 129-140 [doi]
- On Selfish Creation of Robust NetworksAnkit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn. 141-152 [doi]
- Dynamic Resource Allocation GamesGuy Avni, Thomas A. Henzinger, Orna Kupferman. 153-166 [doi]
- Analyzing Power in Weighted Voting Games with Super-Increasing WeightsYoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick. 169-181 [doi]
- Strong and Weak Acyclicity in Iterative VotingReshef Meir. 182-194 [doi]
- Stable Matching with Uncertain Linear PreferencesHaris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari. 195-206 [doi]
- The Stable Roommates Problem with Short ListsÁgnes Cseh, Robert W. Irving, David F. Manlove. 207-219 [doi]
- The Price of Stability of Simple Symmetric Fractional Hedonic GamesChristos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou. 220-232 [doi]
- Truthfulness and Approximation with Value-Maximizing BiddersSalman Fadaei, Martin Bichler. 235-246 [doi]
- Envy-Free Revenue Approximation for Asymmetric Buyers with BudgetsEvangelos Markakis, Orestis Telelis. 247-259 [doi]
- SBBA: A Strongly-Budget-Balanced Double-Auction MechanismErel Segal-haLevi, Avinatan Hassidim, Yonatan Aumann. 260-272 [doi]
- Revenue Maximization for Market Intermediation with Correlated PriorsMatthias Gerstgrasser, Paul W. Goldberg, Elias Koutsoupias. 273-285 [doi]
- Bribeproof Mechanisms for Two-Values DomainsMatús Mihalák, Paolo Penna, Peter Widmayer. 289-301 [doi]
- The Anarchy of Scheduling Without MoneyYiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou. 302-314 [doi]
- An Almost Ideal Coordination Mechanism for Unrelated Machine SchedulingIoannis Caragiannis, Angelo Fanelli. 315-326 [doi]
- Designing Cost-Sharing Methods for Bayesian GamesGeorge Christodoulou 0001, Stefano Leonardi, Alkmini Sgouritsa. 327-339 [doi]