Pages that link to "Item:Q2817671"
From MaRDI portal
The following pages link to Fast algorithms for finding randomized strategies in game trees (Q2817671):
Displaying 25 items.
- Algorithms for computing strategies in two-player simultaneous move games (Q286381) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- Randomized sampling for large zero-sum games (Q490542) (← links)
- Equilibrium semantics of languages of imperfect information (Q636301) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis (Q1039591) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Searching minimax game trees under memory space constraint (Q1356215) (← links)
- Representations and solutions for game-theoretic problems (Q1391352) (← links)
- Multi-agent influence diagrams for representing and solving games. (Q1413219) (← links)
- Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
- Computing human-understandable strategies: deducing fundamental rules of poker strategy (Q1656987) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- Finding mixed strategies with small supports in extensive form games (Q1814784) (← links)
- A sublinear-time randomized approximation algorithm for matrix games (Q1919166) (← links)
- Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
- Game theoretic resource allocation model for designing effective traffic safety solution against drunk driving (Q2177693) (← links)
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games (Q2307334) (← links)
- Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm (Q2389651) (← links)
- A Dynamic Algorithm for Reachability Games Played on Trees (Q3182948) (← links)
- The Variance of Two Game Tree Algorithms (Q4216144) (← links)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (Q5108243) (← links)
- A new lower bound for the list update problem in the partial cost model (Q5958711) (← links)
- HSVI can solve zero-sum partially observable stochastic games (Q6624522) (← links)
