activity
20082020
most citedGame Theory with Costly Computation

37 citations · 87 across the 19 of their papers we have counts for

collaborators
Showing 2013Show all

7 papers · 1 filter

cs.GT2013★ 2 cited

The Truth Behind the Myth of the Folk Theorem

Joseph Y. Halpern, Rafael Pass, Lior Seeman

We study the problem of computing an -Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make…

cs.GT2013

Game Theory with Translucent Players

Joseph Y. Halpern, Rafael Pass

A traditional assumption in game theory is that players are opaque to one another -- if a player changes strategies, then this change in strategies does not affect the choice of ot…

cs.GT2013

Language-based Games

Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass

We introduce language-based games, a generalization of psychological games [6] that can also capture reference-dependent preferences [7]. The idea is to extend the domain of the ut…

cs.GT2013★ 4 cited

Decision Theory with Resource-Bounded Agents

Joseph Y. Halpern, Rafael Pass, Lior Seeman

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein, charges an agent for doing costly comput…

cs.GT2013

Game Theory with Translucent Players

Joseph Y. Halpern, Rafael Pass

A traditional assumption in game theory is that players are opaque to one another---if a player changes strategies, then this change in strategies does not affect the choice of oth…

cs.CR2013

Statistically-secure ORAM with Overhead

Kai-Min Chung, Zhenming Liu, Rafael Pass

We demonstrate a simple, statistically secure, ORAM with computational overhead ; previous ORAM protocols achieve only computational security (under computatio…