Intrinsic robustness of the price of anarchy
From MaRDI portal
Publication:5172746
DOI10.1145/1536414.1536485zbMath1304.91019OpenAlexW2133243407MaRDI QIDQ5172746
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3430
Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (54)
Cost-Sharing in Generalised Selfish Routing ⋮ The price of anarchy and stability in general noisy best-response dynamics ⋮ On Learning Algorithms for Nash Equilibria ⋮ Concurrent imitation dynamics in congestion games ⋮ Mechanisms for (mis)allocating scientific credit ⋮ Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Robust equilibria in location games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Coarse correlated equilibria in linear duopoly games ⋮ Generalized mirror descents in congestion games ⋮ Learning in auctions: regret is hard, envy is easy ⋮ Bifurcation mechanism design -- from optimal flat taxes to better cancer treatments ⋮ Evolutionary game theory: a renaissance ⋮ Collusion in atomic splittable routing games ⋮ On a generalized Cournot oligopolistic competition game ⋮ Incentives and Efficiency in Uncertain Collaborative Environments ⋮ Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions ⋮ Efficient Equilibria in Polymatrix Coordination Games ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Correlated and Coarse Equilibria of Single-Item Auctions ⋮ Equilibrium design in an \(n\)-player quadratic game ⋮ Simultaneous 2nd price item auctions with no-underbidding ⋮ Independent learning in stochastic games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information ⋮ Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games ⋮ Improving Nash by coarse correlation ⋮ Load balancing without regret in the bulletin board model ⋮ Price of Anarchy for Mechanisms with Risk-Averse Agents ⋮ LP-based covering games with low price of anarchy ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ Introduction to computer science and economic theory ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Bounding the inefficiency of outcomes in generalized second price auctions ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ Exact and approximate equilibria for optimal group network formation ⋮ Competitive routing over time ⋮ How good is a two-party election game? ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Unnamed Item ⋮ Price of anarchy for Mean Field Games ⋮ The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games ⋮ Wealth Inequality and the Price of Anarchy ⋮ Item Pricing for Combinatorial Public Projects ⋮ Efficient mixtures of priority rules for assigning objects ⋮ FIFO and randomized competitive packet routing games ⋮ Heterogeneity and chaos in congestion games ⋮ Bottleneck links, variable demand, and the tragedy of the commons
This page was built for publication: Intrinsic robustness of the price of anarchy
