Pages that link to "Item:Q1815001"
From MaRDI portal
The following pages link to Efficient computation of equilibria for extensive two-person games (Q1815001):
Displaying 28 items.
- Algorithms for computing strategies in two-player simultaneous move games (Q286381) (← links)
- The give and take game: analysis of a resource sharing game (Q326999) (← links)
- On taxed matrix games and changes in the expected transfer (Q457868) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Homotopy methods to compute equilibria in game theory (Q847802) (← links)
- Computing sequential equilibria using agent quantal response equilibria (Q847804) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem (Q960113) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Conditional dominance, rationalizability, and game forms (Q1277087) (← links)
- Representations and solutions for game-theoretic problems (Q1391352) (← links)
- A theoretical and empirical investigation of search in imperfect information games (Q1589518) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← 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)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
- Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods (Q3299845) (← links)
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
- Bargaining with limited computation: Deliberation equilibrium (Q5958637) (← 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)
- Online learning in sequential Bayesian persuasion: handling unknown priors (Q6665730) (← links)
