Reducibility among Fractional Stability Problems

DOI10.1109/FOCS.2009.57zbMath1292.68076OpenAlexW2147871692MaRDI QIDQ5171181

Rajmohan Rajaraman, Shiva Kintali, Laura Poplawski, Ravi Sundaram, Shang-Hua Teng

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2009.57

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (8)

Equilibrium computation of the Hart and Mas-Colell bargaining model ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma ⋮ Stable multicommodity flows ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Perfect graphs with polynomially computable kernels ⋮ Bounded budget connection (BBC) games or how to make friends and influence people, on a budget ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata

This page was built for publication: Reducibility among Fractional Stability Problems