On the structure and complexity of worst-case equilibria

DOI10.1016/j.tcs.2007.02.019zbMath1121.91058OpenAlexW2052463720MaRDI QIDQ883997

Berthold Vöcking, Simon Fischer

Publication date: 13 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.019

zbMATH Keywords

load balancingjob schedulingprice of anarchyballs and bins processesfully mixed Nash equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

On the complexity of constrained Nash equilibria in graphical games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Selfish bin coloring ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ How hard is it to find extreme Nash equilibria in network congestion games?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• Approximate equilibria and ball fusion
• Approximation algorithms for the Euclidean bipartite TSP
• Structure and complexity of extreme Nash equilibria
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• The price of selfish routing
• Theoretical Computer Science
• Computing Nash equilibria for scheduling on restricted parallel links

This page was built for publication: On the structure and complexity of worst-case equilibria