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 2024Show all

4 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.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.LG2024★ 2 cited

Temporal Graph ODEs for Irregularly-Sampled Time Series

Alessio Gravina, Daniele Zambon, Davide Bacciu +1

Modern graph representation learning works mostly under the assumption of dealing with regularly sampled temporal graph snapshots, which is far from realistic, e.g., social network…

cs.AI2024★ 2 cited

Scalable Mechanism Design for Multi-Agent Path Finding

Paul Friedrich, Yulun Zhang, Michael Curry +5

Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations. This p…