2 citations · 4 across the 9 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.GT2017
Selling to a No-Regret Buyer
Mark Braverman, Jieming Mao, Jon Schneider +1
We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution in every…
cs.CC2017
The space complexity of mirror games
Sumegha Garg, Jon Schneider
We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set $\{…
cs.GT2017
Multi-armed Bandit Problems with Strategic Arms
Mark Braverman, Jieming Mao, Jon Schneider +1
We study a strategic version of the multi-armed bandit problem, where each arm is an individual strategic agent and we, the principal, pull one arm each round. When pulled, the arm…