Pages that link to "Item:Q2941532"
From MaRDI portal
The following pages link to Inapproximability of Nash Equilibrium (Q2941532):
Displaying 17 items.
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Undecidability of the existence of pure Nash equilibria (Q1424223) (← links)
- Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments (Q1712152) (← links)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution (Q2007652) (← links)
- Morphisms of open games (Q2134815) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601) (← links)
- Inefficiency of Nash Equilibria (Q3722301) (← links)
- (Q4638083) (← links)
- (Q4638112) (← links)
- Hardness results for consensus-halving (Q5005124) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- kNN Classification with an Outlier Informative Distance Measure (Q5045346) (← links)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
- Separable Network Games with Compact Strategy Sets (Q6488586) (← links)