1 citations · 1 across the 1 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2024★ 1 cited
Edge-dominance games on graphs
Farid Arthaud, Edan Orzech, Martin Rinard
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent…
cs.GT2023
Playing repeated games with sublinear randomness
Farid Arthaud
We study the amount of entropy players asymptotically need to play a repeated normal-form game in a Nash equilibrium. Hubáček, Naor, and Ullman (SAGT'15, TCSys'16) gave sufficient…