activity
19982009
most citedDefaults and Normality in Causal Structures

40 citations · 325 across the 40 of their papers we have counts for

collaborators
Showing 2006Show all

7 papers · 1 filter

cs.GT200616 cited

Characterizing Solution Concepts in Games Using Knowledge-Based Programs

Joseph Y. Halpern, Yoram Moses

We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms of…

cs.GT200619 cited

Rational Secret Sharing and Multiparty Computation: Extended Abstract

Joseph Y. Halpern, Vanessa Teague

We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, pre…

cs.AI20062 cited

Using Sets of Probability Measures to Represent Uncertainty

Joseph Y. Halpern

I explore the use of sets of probability measures as a representation of uncertainty.

cs.CR2006

Expressing Security Properties Using Selective Interleaving Functions

Joseph Y. Halpern, Sabina Petride

McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the best-known attempt to construct a framework for expressing various security properties. We examine the exp…

cs.LO200615 cited

Reasoning About Knowledge of Unawareness

Joseph Y. halpern, Leandro Chaves Rego

Awareness has been shown to be a useful addition to standard epistemic logic for many applications. However, standard propositional logics for knowledge and awareness cannot expres…

cs.LO20067 cited

Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic

Joseph Y. Halpern, Leandro Chaves Rego

There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem…