Pages that link to "Item:Q3162529"
From MaRDI portal
The following pages link to On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529):
Displaying 11 items.
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm (Q485776) (← links)
- Resource buying games (Q487012) (← links)
- Competitive routing over time (Q719282) (← links)
- Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
- On the existence of strong Nash equilibria (Q2338799) (← links)
- (Q3089367) (← links)
- On oblivious PTAS's for nash equilibrium (Q5172700) (← links)