4 citations · 8 across the 6 of their papers we have counts for
7 papers
Is state-dependent valuation more adaptive than simpler rules?
Joseph Y. Halpern, Lior Seeman
McNamara, Trimmer, and Houston (2012) claim to provide an explanation of certain systematic deviations from rational behavior using a mechanism that could arise through natural sel…
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
Ashwinkumar Badanidiyuru, Christos Papadimitriou, Aviad Rubinstein +2
The Adaptive Seeding problem is an algorithmic challenge motivated by influence maximization in social networks: One seeks to select among certain accessible nodes in a network, an…
Computational Extensive-Form Games
Joseph Y. Halpern, Rafael Pass, Lior Seeman
We define solution concepts appropriate for computationally bounded players playing a fixed finite game. To do so, we need to define what it means for a \emph{computational game},…
I'd Rather Stay Stupid: The Advantage of Having Low Utility
Lior Seeman
Motivated by cost of computation in game theory, we explore how changing the utilities of players (changing their complexity costs) affects the outcome of a game. We show that even…
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…
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…