Pages that link to "Item:Q1815000"

The following pages link to Efficient computation of behavior strategies (Q1815000):

Displaying 31 items.

• First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
• Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
• Homotopy methods to compute equilibria in game theory (Q847802) (← links)
• Enumeration of Nash equilibria for two-player games (Q847809) (← links)
• Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies (Q903026) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem (Q960113) (← links)
• The complexity of two-person zero-sum games in extensive form (Q1195597) (← links)
• Conditional dominance, rationalizability, and game forms (Q1277087) (← links)
• Representations and solutions for game-theoretic problems (Q1391352) (← links)
• Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
• Efficient computation of equilibria for extensive two-person games (Q1815001) (← links)
• Limited lookahead in imperfect-information games (Q1989388) (← links)
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
• Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
• A characterization of quasi-perfect equilibria (Q2195700) (← links)
• Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
• Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games (Q2307334) (← links)
• Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
• Fast algorithms for finding randomized strategies in game trees (Q2817671) (← links)
• Recursive Inspection Games (Q3186537) (← links)
• A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES (Q3560092) (← links)
• (Q3624181) (← links)
• Structure theorems for game trees (Q4547720) (← links)
• Zero-Sum Two Person Games (Q5149734) (← links)
• Bargaining with limited computation: Deliberation equilibrium (Q5958637) (← links)
• A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
• Solving zero-sum one-sided partially observable stochastic games (Q6098841) (← links)
• Polytope-form games and index/degree theories for extensive-form games (Q6176749) (← links)
• Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium (Q6551257) (← links)
• HSVI can solve zero-sum partially observable stochastic games (Q6624522) (← links)