1 citations · 2 across the 6 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2015★ 1 cited
When Can Limited Randomness Be Used in Repeated Games?
Pavel Hubáček, Moni Naor, Jonathan Ullman
The central result of classical game theory states that every finite normal form game has a Nash equilibrium, provided that players are allowed to use randomized (mixed) strategies…
cs.GT2014
Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit
Pavel Hubáček, Sunoo Park
In this work we apply methods from cryptography to enable any number of mutually distrusting players to implement broad classes of mediated equilibria of strategic games without th…