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 14 items.
- Parallel approximation of min-max problems (Q354658) (← 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)
- 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)
- Finding mixed strategies with small supports in extensive form games (Q1814784) (← 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)
- Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm (Q2389651) (← 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)
