Pages that link to "Item:Q1995464"
From MaRDI portal
The following pages link to The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464):
Displaying 8 items.
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- The Effective Computation of Equilibrium Point for <i>N</i>-Person Games Cyclic to the Next Person (Q3980612) (← links)
- Risk-free bidding in complement-free combinatorial auctions (Q5918704) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
