Intrinsic Robustness of the Price of Anarchy
From MaRDI portal
Publication:3177741
DOI10.1145/2806883zbMath1427.91015OpenAlexW2294025081MaRDI QIDQ3177741
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3430
Related Items (39)
Congestion Games with Complementarities ⋮ Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ Principal-agent VCG contracts ⋮ Convergence of incentive-driven dynamics in Fisher markets ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Competitive algorithms for demand response management in a smart grid ⋮ Bayesian generalized network design ⋮ Smart routing of electric vehicles for load balancing in smart grids ⋮ Unnamed Item ⋮ Non-atomic one-round walks in congestion games ⋮ The impact of worst-case deviations in non-atomic network routing games ⋮ Scheduling games with machine-dependent priority lists ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Tight welfare guarantees for pure Nash equilibria of the uniform price auction ⋮ Unnamed Item ⋮ Congestion games with priority-based scheduling ⋮ Limited-trust equilibria ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Unnamed Item ⋮ Location Games on Networks: Existence and Efficiency of Equilibria ⋮ Game efficiency through linear programming duality ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ Delegation and ambiguity in correlated equilibrium ⋮ Selfishness Need Not Be Bad ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users ⋮ Bounding quality of pure Nash equilibria in dual-role facility location games ⋮ The Price of Stability of Weighted Congestion Games ⋮ An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions ⋮ Small-Loss Bounds for Online Learning with Partial Information
This page was built for publication: Intrinsic Robustness of the Price of Anarchy
