Pages that link to "Item:Q1195597"
From MaRDI portal
The following pages link to The complexity of two-person zero-sum games in extensive form (Q1195597):
Displayed 25 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Team-maxmin equilibria (Q1378009) (← links)
- The independent choice logic for modelling multiple agents under uncertainty (Q1391346) (← links)
- Representations and solutions for game-theoretic problems (Q1391352) (← links)
- Propositional logic of imperfect information: Foundations and applications (Q1422098) (← links)
- Successful Nash equilibrium agent for a three-player imperfect-information game (Q1651920) (← 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)
- 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)
- Computer science and decision theory (Q2271874) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES (Q3560092) (← links)
- A Logic for Reasoning about Rational Agents (Q3602940) (← links)
- (Q5075766) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)