output
20222026
most citedFinding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks

3 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.GTShow all

4 papers · 1 filter

cs.GT2026

Efficient representations for team and imperfect-recall equilibrium computation

Luca Carminati, Brian Hu Zhang, Federico Cacciamani +4

Equilibrium finding in two-player zero-sum games with perfect recall is a well-studied topic that has led to many breakthroughs in computational game theory. This paper aims to gen…

cs.GT2024

Joint-perturbation simultaneous pseudo-gradient

Carlos Martin, Tuomas Sandholm

We study the problem of computing an approximate Nash equilibrium of a game whose strategy space is continuous without access to gradients of the utility function. Such games arise…

cs.GT2024

Layered Graph Security Games

Jakub Černý, Chun Kai Ling, Christian Kroer +1

Security games model strategic interactions in adversarial real-world applications. Such applications often involve extremely large but highly structured strategy sets (e.g., selec…

cs.GT2022★ 3 cited

Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks

Carlos Martin, Tuomas Sandholm

We study the problem of computing an approximate Nash equilibrium of continuous-action game without access to gradients. Such game access is common in reinforcement learning settin…