Pages that link to "Item:Q5171181"
From MaRDI portal
The following pages link to Reducibility among Fractional Stability Problems (Q5171181):
Displaying 8 items.
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- Stable multicommodity flows (Q1736550) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Equilibrium computation of the Hart and Mas-Colell bargaining model (Q2637848) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (Q5920341) (← links)