3 citations · 7 across the 10 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
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.AI2024
AlphaZeroES: Direct score maximization outperforms planning loss minimization
Carlos Martin, Tuomas Sandholm
Planning at execution time has been shown to dramatically improve performance for agents in both single-agent and multi-agent settings. A well-known family of approaches to plannin…
cs.GT2024
Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games
Carlos Martin, Tuomas Sandholm
We present a framework for computing approximate mixed-strategy Nash equilibria of continuous-action games. It is a modification of the traditional double oracle algorithm, extende…