25 citations · 35 across the 4 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2020
A Bridge between Polynomial Optimization and Games with Imperfect Recall
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivari…
cs.GT2013★ 1 cited
Infinite games with uncertain moves
Nicholas Asher, Soumya Paul
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a…
cs.GT2010★ 7 cited
Imitation in Large Games
Soumya Paul, R. Ramanujam
In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a l…