Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Smoothing Techniques for Computing Nash Equilibria of Sequential Games

3 references·7 citing·27 second hop

FromToDepth

this work references cited by second hop

References

1994A Course in Game Theory5,468 cited
1996Efficient Computation of Equilibria for Extensive Two-Person Games228 cited
1996Efficient Computation of Behavior Strategies199 cited

Cited by

2014An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information78 cited
2012Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types50 cited
2014Near-optimal no-regret algorithms for zero-sum games43 cited
2017Dynamic Thresholding and Pruning for Regret Minimization39 cited
2008First-order algorithm with O(ln(1/ε )) convergence for ε -equilibrium in two-person zero-sum games32 cited
2010First-order algorithm with $${\mathcal{O}({\rm ln}(1{/}\epsilon))}$$ convergence for $${\epsilon}$$ -equilibrium in two-person zero-sum games30 cited
2015Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies30 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work