Pages that link to "Item:Q3169104"
From MaRDI portal
The following pages link to Smoothing Techniques for Computing Nash Equilibria of Sequential Games (Q3169104):
Displaying 11 items.
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- Limited lookahead in imperfect-information games (Q1989388) (← links)
- Accelerated gradient sliding for structured convex optimization (Q2141354) (← 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)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- Portfolio Selection with Multiple Spectral Risk Constraints (Q5258454) (← links)
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
- HSVI can solve zero-sum partially observable stochastic games (Q6624522) (← links)
