activity
19982008
most citedGame Theory with Costly Computation

37 citations · 224 across the 29 of their papers we have counts for

collaborators
Showing 2007Show all

9 papers · 1 filter

cs.AI20072 cited

A Game-Theoretic Analysis of Updating Sets of Probabilities

Peter D. Grunwald, Joseph Y. Halpern

We consider how an agent should update her uncertainty when it is represented by a set of probability distributions and the agent observes that a random variable takes on v…

cs.DC2007

A Knowledge-Based Analysis of Global Function Computation

Joseph Y. Halpern, Sabina Petride

Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends…

cs.GT2007

Generalized Solution Concepts in Games with Possibly Unaware Players

Leandro C. Rego, Joseph Y. Halpern

Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for r…

cs.GT20073 cited

Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists

Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern

We discuss the design of efficient scrip systems and develop tools for empirically analyzing them. For those interested in the empirical study of scrip systems, we demonstrate how…

cs.GT20071 cited

Efficiency and Nash Equilibria in a Scrip System for P2P Networks

Eric j. Friedman, Joseph Y. Halpern, Ian Kash

A model of providing service in a P2P network is analyzed. It is shown that by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium that reduces free riding…

cs.DB200718 cited

Worst-Case Background Knowledge for Privacy-Preserving Data Publishing

David J. Martin, Daniel Kifer, Ashwin Machanavajjhala +2

Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publisher does…