20 citations · 43 across the 26 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.GT2016★ 1 cited
Computing Human-Understandable Strategies
Sam Ganzfried, Farzana Yusuf
Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest…
cs.AI2016★ 2 cited
Optimal Number of Choices in Rating Contexts
Sam Ganzfried, Farzana Yusuf
In many settings people must give numerical scores to entities from a small discrete set. For instance, rating physical attractiveness from 1--5 on dating sites, or papers from 1--…
cs.GT2016
Bayesian Opponent Exploitation in Imperfect-Information Games
Sam Ganzfried, Qingyun Sun
Two fundamental problems in computational game theory are computing a Nash equilibrium and learning to exploit opponents given observations of their play (opponent exploitation). T…