Pages that link to "Item:Q1995464"

The following pages link to The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464):

Displayed 4 items.

• 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)
• 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)