1 citations · 1 across the 10 of their papers we have counts for
Showing 2026 · math.OCShow all
2 papers · 2 filters
math.OC2026
Potential Games on Unimodular Random Graphs
Eyal Neuman, Sturmius Tuschmann
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed…
math.OC2026
Stochastic Games on Large Sparse Graphs
Eyal Neuman, Sturmius Tuschmann
We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the v…