default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th SAGT 2016: Liverpool, UK
- Martin Gairing, Rahul Savani:
Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings. Lecture Notes in Computer Science 9928, Springer 2016, ISBN 978-3-662-53353-6
Computational Aspects of Games
- Paul W. Goldberg
, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. 3-14 - Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. 15-26 - Guillaume Ducoffe:
The Parallel Complexity of Coloring Games. 27-39 - Stéphane Durand, Bruno Gaujal:
Complexity and Optimality of the Best Response Algorithm in Random Potential Games. 40-51 - Edon Kelmendi, Hugo Gimbert:
Deciding Maxmin Reachability in Half-Blind Stochastic Games. 52-63 - Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký:
The Big Match in Small Space - (Extended Abstract). 64-76 - Amos Fiat, Yishay Mansour, Mariano Schain:
History-Independent Distributed Multi-agent Learning. 77-89
Congestion Games and Networks
- Vittorio Bilò:
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games. 93-104 - Jasper de Jong, Max Klimm, Marc Uetz:
Efficiency of Equilibria in Uniform Matroid Congestion Games. 105-116 - Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. 117-128 - Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. 129-140 - Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn:
On Selfish Creation of Robust Networks. 141-152 - Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic Resource Allocation Games. 153-166
Matching and Voting
- Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. 169-181 - Reshef Meir:
Strong and Weak Acyclicity in Iterative Voting. 182-194 - Haris Aziz, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Linear Preferences. 195-206 - Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Short Lists. 207-219 - Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou:
The Price of Stability of Simple Symmetric Fractional Hedonic Games. 220-232
Auctions and Markets
- Salman Fadaei, Martin Bichler:
Truthfulness and Approximation with Value-Maximizing Bidders. 235-246 - Evangelos Markakis, Orestis Telelis:
Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets. 247-259 - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. 260-272 - Matthias Gerstgrasser, Paul W. Goldberg, Elias Koutsoupias:
Revenue Maximization for Market Intermediation with Correlated Priors. 273-285
Mechanism Design
- Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof Mechanisms for Two-Values Domains. 289-301 - Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. 302-314 - Ioannis Caragiannis, Angelo Fanelli:
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. 315-326 - George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. 327-339
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
