The following pages link to (Q4536701):
Displaying 7 items.
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- Effective short-term opponent exploitation in simplified poker (Q1009317) (← links)
- Agendas for multi-agent learning (Q1028923) (← 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)
- Learning to bid in bridge (Q2433171) (← links)
- The challenge of poker (Q5958207) (← links)
