Publications Organized By Topic

Reasoning about Knowledge and Belief

Surveys and Overviews

Using reasoning about knowledge to analyze distributed systems, in Annual Reviews of Computer Science, Vol. 2 (ed. J. F. Traub, B. J. Grosz, B. W. Lampson, and N. J. Nilsson), Annual Reviews Inc., 1987, pp. 37-68.
Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference, Morgan Kaufmann, 1986 (editor).
Reasoning about knowledge: an overview, Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference, Morgan Kaufmann, 1986, pp. 1-17; reprinted in Proceedings of the National Computer Conference, 1986, pp. 219-228.
Reasoning about knowledge: a survey, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4, D. Gabbay, C. J. Hogger, and J. A. Robinson, eds., Oxford University Press, 1995, pp. 1-34.
Reasoning About Knowledge, MIT Press, 1995; revised paperback edition published in 2003 (with R. Fagin, Y. Moses, and M. Y. Vardi).
Handbook of Epistemic Logic, College Publications, 2015 (with H. Ditmarsch, W. van der Hoek, and B. Kooi).
An introduction to logics of knowledge and belief, in Handbook of Epistemic Logic (H. van Ditmarsch, J. Y. Halpern, W. van der Hoek, and B. Kooi, editors), College Publications, 2015, pp. 1-51.

Technical Papers

Towards a theory of knowledge and ignorance, Logics and Models of Concurrent Systems (ed. K. Apt), Springer-Verlag, 1985, pp. 459-476 and in Proceedings of the Workshop on Non-Monotonic Reasoning, 1984, pp. 125-143 (with Y. Moses).
Cheating husbands and other stories: a case study in knowledge, action, and communication, Distributed Computing 1:3, 1986, pp. 167-176 (with D. Dolev and Y. Moses).
Belief, awareness, and limited reasoning, Artificial Intelligence 34, 1988, pp. 39-76 (with R. Fagin).
A knowledge-based analysis of zero knowledge, Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 132-147 (with Y. Moses and M. Tuttle).
I'm OK if you're OK: On the notion of trusting communication, Journal of Philosophical Logic 17:4, 1988, pp. 329-354 (with R. Fagin).
The complexity of reasoning about knowledge and time, I: lower bounds, Journal of Computer and Systems Science 38:1, 1989, pp. 195-237 (with M. Y. Vardi).
Modelling knowledge and action in distributed systems, Distributed Computing 3:4, 1989, pp. 159-177 (with R. Fagin).
Knowledge and common knowledge in a distributed environment, Journal of the ACM 37:3, 1990, pp. 549-587 (with Y. Moses).
A characterization of eventual Byzantine agreement, SIAM Journal on Computing 31:3, 2001, pp. 838-865 (with Y. Moses and O. Waarts).
The relationship between knowledge, belief, and certainty, Annals of Mathematics and Artificial Intelligence 4, 1991, pp. 301-322.
A model-theoretic analysis of knowledge, Journal of the ACM 38:2, 1991, pp. 382-428 (with R. Fagin and M. Y. Vardi).
Model checking vs. theorem proving: a manifesto, Artificial Intelligence and Mathematical Theory of Computation (Papers in Honor of John McCarthy) (ed. V. Lifschitz), Academic Press, 1991, pp. 151-176 (with M. Vardi).
A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54, 1992, pp. 319-379 (with Y. Moses).
A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols, Journal of the ACM 39:3, 1992, pp. 449-478 (with L. Zuck).
Knowledge, probability, and adversaries, Journal of the ACM 40:4, pp. 917-962, 1993 (with M. Tuttle).
Naming and identity in epistemic logics, I: The propositional case, Journal of Logic and Computation 3:4, 1993, pp. 345-378 (with A. J. Grove).
Reasoning about knowledge and probability, Journal of the ACM 41:2, 1994, pp. 340-367 (with R. Fagin).
Algorithmic knowledge, Proceedings of the 5th Conference on Theoretical Aspects of Reasoning About Knowledge, 1994, pp. 255-266 (with Y. Moses and M. Y. Vardi).
An operational semantics for knowledge bases, AAAI-94 (Proceedings of the Twelfth National Conference on Artificial Intelligence), pp. 1142-1147, 1994 (with R. Fagin, Y. Moses, and M. Y. Vardi).
Levesque's axiomatization of only knowing is incomplete, Artificial Intelligence 74:2, 1995, pp. 381-387 (with G. Lakemeyer).
A nonstandard approach to the logical omniscience problem, Artificial Intelligence 79:2, 1995, pp. 203-240 (with R. Fagin and M. Y. Vardi).
Should knowledge entail belief?, Journal of Philosophical Logic 25:5, 1996, pp. 483-494.
Multi-agent only knowing, Journal of Logic and Computation 11:1, 2001, pp. 41-70 (with G. Lakemeyer).
On the knowledge requirements for tasks, Artificial Intelligence 98:1-2, 1998, pp. 317-349 (with R. Brafman and Y. Shoham).
Hypothetical knowledge and counterfactual reasoning, International Journal of Game Theory 28:3, 1999, pp. 315-330.
Common knowledge revisited, Annals of Pure and Applied Logic 96, 1999, pp. 89-105. (with R. Fagin, Y. Moses, and M. Y. Vardi).
A theory of knowledge and ignorance for many agents, Journal of Logic and Computation 7:1, 1997, pp. 79-108.
On ambiguities in the interpretation of game trees, Games and Economic Behavior 20, 1997, pp. 66-96.
Knowledge-based programs, Distributed Computing 10:4, 1997, pp. 199-225 (with R. Fagin, Y. Moses, and M. Y. Vardi).
Complete axiomatizations for reasoning about knowledge and time, SIAM Journal on Computing 33:2, 2004, pp. 674-703 (with R. van der Meyden, and M. Y. Vardi)
Set-theoretic completeness for epistemic and conditional logic, Annals of Mathematics and Artificial Intelligence 26, 1999, pp. 1-27.
The hierarchical approach to modeling knowledge and common knowledge, International Journal of Game Theory 28:3, 1999, pp. 331-365 (with R. Fagin, J. Geanakoplos, and M. Y. Vardi).
Characterizing the common prior assumption, Journal of Economic Theory 106:2, 2002, pp. 316-355.
Using counterfactuals in knowledge-based programming, Distributed Computing 17:2, pp. 91-106 (with Y. Moses).
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors, Distributed Computing 17:3, 2005, pp. 223-236 (with A. Ricciardi).
Reasoning about common knowledge with infinitely many agents, Information and Computation 191:1, 2004, pp. 1-40 (with R. Shore).
Substantive rationality and backward induction Games and Economic Behavior 37, 2001, pp. 425-435.
Alternative semantics for unawareness, Games and Economic Behavior 37, 2001, pp. 321-339.
A note on knowledge-based protocols and specifications, Distributed Computing 13:3, 2000, pp. 145-153.
Secrecy in multi-agent systems, ACM Transactions on Information and System Security 12:1, 2008, (with K. O'Neill).
Complete axiomatizations for reasoning about knowledge and time, SIAM Journal on Computing 33:2, 2004, pp. 674-703 (with R. van der Meyden and M. Vardi).
Modeling adversaries in a logic for security protocol analysis, Logical Methods in Computer Science 8:1, 2012 (with R. Pucella).
Anonymity and information hiding in multiagent systems, Journal of Computer Security 13:3, 2005, pp. 483-514 (with K. O'Neill).
Probabilistic algorithmic knowledge, Logical Methods in Computer Science 1:3, 2005 (with R. Pucella).
Knowledge-based synthesis of distributed systems using event structures, Logical Methods in Computer Science 7:2, 2011 (with M. Bickford, R. L. Constable, J. Y. Halpern, and S. Petride)
Interactive awareness revisited, Games and Economic Behavior 62:1, 2008, pp. 232-262 (with L. Rego)
Reasoning about knowledge of unawareness, Games and Economic Behavior 67:2, 2009, pp. 503-525, 2009, (with L. Rego)
A knowledge-based analysis of global function computation, Distributed Computing 23:3, 2010, pp. 197-224. (with S. Petride).
Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic, Journal of Logic and Computation 17:4, pp. 795-806, 2007 (with L. Rego).
Dealing with logical omniscience, Artificial Intelligence 175:1, 2011, pp. 220-235 (with R. Pucella).
Generalized solution concepts in games with possibly unaware players, International Journal of Game Theory :1, 2012, pp. 131-155 (with L. C. Rego).
Defining knowledge in terms of belief: the modal logic perspective, Review of Symbolic Logic (with D. Samet and E. Segev).
A logical characterization of iterated admissibility, Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 146-155 (with R. Pass).
An epistemic characterization of zero knowledge, Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 156-165 (with R. Pass and V. Raman).
Reasoning about knowledge of unawareness revisited, Games and Economic Behavior 67:2, 2009, pp. 503-525 (with L. C. Rego).
Solution to Exchanges 8.1 puzzle: Identifying the champion, (with S. Airiau and U. Endriss), SIGECOM Exchanges 8.2, 2009, pp. 1-2.
Awareness in games, awareness in logic, Proceedings of LPAR-17 Lecture Notes in Computer Science, vol. 6397, Springer, 2010, p. 15.
Conservative belief and rationality, Games and Economic Behavior 80, 2013, pp. 186-192 (with R. Pass).
Reasoning about justified belief, Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2011, pp. 221-227 (with A. Bjorndahl and R. Pass).
Ambiguous language and differences in beliefs, Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), 2012, pp. 329-338 (with W. Kets).
A logic for reasoning about ambiguity, Artificial Intelligence 209, 2014, pp. 1-10 (with W. Kets).
A procedural characterization of solution concepts in games, Journal of AI Research 49, 2014, pp. 143-170 (with Y. Moses).
Ambiguous language and common priors, Games and Economic Behavior 90, 2015, pp. 171-180 (with W. Kets).
Reasoning about rationality, Games and Economic Behavior 104, 2017, pp. 146-164 (with A. Bjorndahl and R. Pass).
Characterizing solution concepts in terms of common knowledge of rationality, International Journal of Game Theory 46:2, 2017, pp. 457-473 (with Y. Moses).
A knowledge-based analysis of the blockchain protocol, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 324-335 (with R. Pass).
An epistemic foundation for authentication logics, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 306-323 (with R. van der Meyden and R. Pucella).
From type spaces to probability frames and back, via language, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 75-87 (with A. Bjorndahl).
Partial awareness, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 201 (with E. Piermont).
Dynamic partial awareness, Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020 (with E. Piermont).
A conceptually well-founded characterization of iterated admissibility using an ``all I know'' operator, Proceedings of Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science, 2019 (with R. Pass).
Joint behavior and common belief, Proceedings of Ninteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 379, 2023, pp. 221-232 (with M. Friedenberg).

Reasoning about Uncertainty

Surveys and Overviews

A logical approach to reasoning about uncertainty: a tutorial, Discourse, Interaction, and Communication, X. Arrazola, K. Korta, and F. J. Pelletier, eds., Kluwer, 1998, pp. 141-155.
Reasoning About Uncertainty, MIT Press, 2003; (slightly) revised paperback edition published in 2005; second edition published in 2017.

Probabilistic Reasoning

A logic for reasoning about probabilities, Information and Computation 87:1,2, 1990, pp. 78-128 (with R. Fagin and N. Megiddo)
An analysis of first-order logics of probability, Artificial Intelligence 46, 1990, pp. 311-350.
Let many flowers bloom: a response to ``An inquiry into computer understanding'', Computational Intelligence 6, 1990, pp. 184-188.
The relationship between knowledge, belief, and certainty, Annals of Mathematics and Artificial Intelligence 4, 1991, pp. 301-322.
Uncertainty, belief, and probability, Computational Intelligence 7, 1991, pp. 160-173 (with R. Fagin).
Knowledge, probability, and adversaries, Journal of the ACM 40:4, pp. 917-962, 1993 (with M. Tuttle).
A response to ``Believing on the basis of evidence'', Computational Intelligence 10:1, 1994, pp. 21-25 (with F. Bacchus, A. J. Grove, and D. Koller).
Reasoning about knowledge and probability, Journal of the ACM 41:2, 1994, pp. 340-367 (with R. Fagin).
Decidability and expressiveness for first-order logics of probability, Information and Computation 112:1, 1994, pp. 1-36 (with M. Abadi).
Reasoning about noisy sensors in the situation calculus, Artificial Intelligence 111, 1999, pp. 131-169 (with F. Bacchus and H. Levesque).
Representation dependence in probabilistic inference, Journal of AI Research 21, 2004, pp. 319-356 (with D. Koller).
Asymptotic conditional probabilities: the unary case, SIAM Journal on Computing 25:1, 1996, pp. 1-51, (with A. J. Grove and D. Koller).
Asymptotic conditional probabilities: the non-unary case, Journal of Symbolic Logic 61:1, 1996, pp. 250-275 (with A. J. Grove and D. Koller).
A counterexample to theorems of Cox and Fine, In Journal of AI Research 10, 1999, pp. 67-85.
Cox's Theorem revisited In Journal of AI Research 11, 1999, pp. 429-435.
Irrelevance and conditioning in first-order probabilistic logic, AAAI-96 (Proceedings of the Thirteenth National Conference on Artificial Intelligence), 1996, pp. 569-576 (with D. Koller).
Probability update: conditioning vs. cross-entropy, Proceedings of the Thirteenth Conference on Uncertainty in AI, 1997, pp. 208-214 (with A. J. Grove).
Defining explanation in probabilistic systems, Proceedings of the Thirteenth Conference on Uncertainty in AI, 1997, pp. 62-71 (with U. Chajewska).
Updating sets of probabilities, Proceedings of the Fourteenth Conference on Uncertainty in AI, 1998, pp. 173-182 (with A. Grove).
Lexicographic probability, conditional probability, and nonstandard probability, Games and Economic Behavior 68:1, 2010, pp. 155-179.
A logic for reasoning about upper probabilities, Journal of AI Research 17, pp. 57-81, 2002 (with R. Pucella).
Updating probabilities, Journal of AI Research 19, 2003, pp. 243-278 (with P. D. Grunwald).
Characterizing and reasoning about probabilistic and non-probabilistic expectation, Journal of the ACM 54:3, 2007 (with R. Pucella).
Probabilistic algorithmic knowledge Logical Methods in Computer Science 1:3, 2005 (with R. Pucella).
A logic for reasoning about evidence, Journal of AI Research 26, 2006, pp. 1-34 (with R. Pucella).
Sleeping Beauty reconsidered: conditioning and reflection in asynchronous systems, Oxford Studies in Epistemology, Vol. 1 (T. S. Gendler and J. Hawthorne, eds.), 2005, pp. 111-142.
When ignorance is bliss, Proceedings of the Twentieth Conference on Uncertainty in AI, 2004, pp. 226-234 (with P. D. Grunwald).
Evidence with uncertain likelihoods, Synthese 171:1, 2009, pp. 111-133 (with R. Pucella).
Making decisions using sets of probabilities: updating, time consistency, and calibration, Journal of AI Research 42, 2011, pp. 393-426 (with P. D. Grunwald). An earlier version, "A game-theoretic analysis of updating sets of probabilities" appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in AI, 2008, pp. 240-247.
Heuristics, Probability and Causality: A Tribute to Judea Pearl, College Publications, 2010 (editor; with R. Dechter and H. Geffner).
Conditional belief types, Games and Economic Behavior 87, 2014 pp. 253-268 (with A. Di Tillio and D. Samet).
Weighted sets of probabilities and minimax weighted expected regret: new approaches for representing uncertainty and making decisions, Theory and Decision 79:3, 2015, pp. 415-450 (with S. Leung).
Weighted regret-based likelihood: a new approach to describing uncertainty, Journal of AI Research 54, 2015, pp. 471-492.
The role of the protocol in anthropic reasoning, Ergo, 2:9, 2015, pp. 195-206.
Updating probability: tracking statistics as criterion, British Journal for the Philosophy of Science 68:3, 2017, pp. 725-743 (with B. van Fraassen).
Minimizing regret in dynamic decision problems, Theory and Decision 811, 2016, pp. 123-151 (with S. Leung).
Maxmin weighted expected utility: a simpler characterization, Theory and Decision 80:4, 2016, pp. 581-610 (with S. Leung).
Information acquisition under resource limitations in a noisy environment, Journal of the ACM 69:3, 2022 (with M. Soloviev).
A note on the existence of ratifiable acts, Review of Symbolic Logic 13:3, 2018, pp. 503-508.
Probabilistic dependency graphs, Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21), 2021 (with O. Richardson).
Probabilistic and Causal Inference: The Works of Judea Pearl, ACM Press, 2022 (with H. Geffner and R. Dechter).

Plausibility Measures

Plausibility measures: a user's guide, Proceedings of the Eleventh Conference on Uncertainty in AI, 1995, pp. 175-184 (with N. Friedman).
Plausibility measures and default reasoning, Journal of the ACM 48:4, 2001, pp. 648-685 (with N. Friedman).
First-order conditional logic for default reasoning revisited, ACM Transactions on Computational Logic 1:2, 2000, pp. 175-207 (with N. Friedman and D. Koller).
A qualitative Markov assumption and its implications for belief change, Proceedings of the Twelfth Conference on Uncertainty in AI, 1996, pp. 263-273 (with N. Friedman).
Modeling belief in dynamic systems. Part I: Foundations, Artificial Intelligence 95:2, 1997, pp. 257-316 (with N. Friedman).
Modeling belief in dynamic systems. Part II: Revision and Update, Journal of AI Research 10, 1999, pp. 117-167 (with N. Friedman).
Belief revision: a critique, Journal of Logic, Language, and Information 8, 1999, pp. 401-420 (with N. Friedman).
Plausibility measures and default reasoning: an overview (invited talk), Proceedings of the 14th IEEE Symposium on Logic in Computer Science, 1999, pp. 130-135 (with N. Friedman).
Conditional plausibility measures and Bayesian networks, Journal of AI Research 14, 2001, pp. 359-389.
Plausibility measures: A general approach for representing uncertainty, Proceedings of the 17th International Joint Conference on AI (IJCAI 2001), 2001, pp. 1474-1483.

From Statistics to Beliefs

From statistics to belief, Proceedings of AAAI-92 (Proceedings of the Tenth National Conference on Artificial Intelligence, 1992, pp. 602-608 (with F. Bacchus, A. J. Grove, and D. Koller).
Statistical foundations for default reasoning, Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93), 1993, pp. 563-569 (with F. Bacchus, A. J. Grove, and D. Koller).
Generating degrees of belief from statistical information: an overview, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 761, Springer, 1993, pp. 318-325 (with F. Bacchus, A. J. Grove, and D. Koller).
Random worlds and maximum entropy, Journal of AI Research 2, 1994, pp. 33-88 (with A. J. Grove and D. Koller).
Forming beliefs about a changing world, AAAI-94 (Proceedings of the Twelfth National Conference on Artificial Intelligence), 1994, pp. 222-229 (with F. Bacchus, A. J. Grove, and D. Koller).
Generating new beliefs from old, Proceedings of the Tenth Conference on Uncertainty in AI, 1994, pp. 37-45 (with F. Bacchus, A. J. Grove, and D. Koller).
A response to ``Believing on the basis of evidence'', Computational Intelligence 10:1, 1994, pp. 21-25 (with F. Bacchus, A. J. Grove, and D. Koller).
Asymptotic conditional probabilities: the unary case, SIAM Journal on Computing 25:1, 1996, pp. 1-51, (with A. J. Grove and D. Koller).
Asymptotic conditional probabilities: the non-unary case, Journal of Symbolic Logic 61:1, 1996, pp. 250-275 (with A. J. Grove and D. Koller).
From statistical knowledge bases to degrees of belief, Artificial Intelligence 87:1-2, 1996, pp. 75-143 (with F. Bacchus, A. J. Grove, and D. Koller).

Dempster-Shafer Belief Functions

Uncertainty, belief, and probability, Computational Intelligence 7, 1991, pp. 160-173 (with R. Fagin).
A new approach to updating beliefs, Uncertainty in Artificial Intelligence 6, (eds. P. P. Bonissone, M. Henrion, L. N. Kanal, and J. F. Lemmer), 1991, pp. 347-374 (with R. Fagin).
Two views of belief: belief as generalized probability and belief as evidence, Artificial Intelligence 54, 1992, pp. 275-317 (with R. Fagin).

Likelihood and Other More Qualitative Approaches

A logic to reason about likelihood, Artificial Intelligence 32:3, 1987, pp. 379-405 (with M. O. Rabin).
Likelihood, probability, and knowledge, Computational Intelligence 5, pp. 151-160, 1989 (with D. A. McAllester).
Defining relative likelihood in partially-ordered preferential structures, Journal of AI Research 7, 1997, pp. 1-24. April, 1997
Weighted regret-based likelihood: a new approach to describing uncertainty, Journal of AI Research 54, 2015, pp. 471-492

Causal and Counterfactual Reasoning

Hypothetical knowledge and counterfactual reasoning, International Journal of Game Theory 28:3, 1999, pp. 315-330.
Using counterfactuals in knowledge-based programming, Distributed Computing 17:2, pp. 91-106 (with Y. Moses).
Axiomatizing causal reasoning, Journal of AI Research 12, 2000, pp. 317-337.
Causes and explanations: a structural-model approach. Part I: Causes, British Journal for Philosophy of Science 56:4, 2005, pp. 843-887 (with J. Pearl).
Causes and explanations: a structural-model approach. Part II: Explanations, British Journal for Philosophy of Science 56:4, 2005, pp. 889-911 (with J. Pearl).
Responsibility and blame: A structural-model approach. Journal of AI Research 22, 2004, pp. 93-115 (with H. Chockler).
What causes a system to satisfy a specification?, ACM Transactions on Computational Logic 9:3, 2008 (with H. Chockler and O. Kupferman).
Defaults and normality in causal structures, Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), 2008, pp. 198-208.
From causal models to counterfactual structures, Review of Symbolic Logic 6:2, 2013, pp. 305-322.
Heuristics, Probability and Causality: A Tribute to Judea Pearl, College Publications, 2010 (editor; with R. Dechter and H. Geffner).
Actual causation and the art of modeling, in Heuristics, Probability and Causality: A Tribute to Judea Pearl (editors, R. Dechter, H. Geffner, and J. Y. Halpern), College Publications, 2010, pp. 383-406 (with C. Hitchcock).
Causality in databases, IEEE Data Engineering Bulletin 33:3, 2010, pp. 59-67 (with A. Meliou, W. Gatterbauer, C. Koch, K. F. Moore, and D. Suciu).
Graded causation and defaults, British Journal for the Philosophy of Science 66:2, 2015, pp. 413-457 (with C. Hitchcock).
Compact representations of extended causal models, Cognitive Science 37:6, 2013, pp. 986-1010 (with C. Hitchcock).
Appropriate causal models and stability of causation, Review of Symbolic Logic 9:1, 2016, pp. 76-102.
The computational complexity of structure-based causality, Journal of AI Research 58, 2017, pp. 431-341 (with G. Aleksandrowicz, H. Chockler, and A. Ivrii).
Cause, responsibility, and blame: a structural-model approach, Law, Probability, and Risk 14:2, 2015, pp. 91-118.
Responsibility judgments in voting scenarios, Proceedings of the 37th Annual Conference of the Cognitive Science Society (CogSci 2015, 2015, pp. 788-793 (with T. Gerstenberg and J. B. Tenenbaum).
A modification of the Halpern-Pearl definition of causality Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 2015, pp. 3022-3033.
Sufficient conditions for causality to be transitive, 83:2, 2016, 213-226, Philosophy of Science.
Actual Causality, MIT Press, 2016.
Causality, responsibility, and blame in team plans, Proceedings of the Sixteenth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017), 2017, pp. 1091-1099 (with N. Alechina and B. Logan).
Combining experts' causal judgments, Artificial Intelligence 288, 2020 (with D. Alrajeh and H. Chockler).
Combining the causal judgments of experts with possibly different focus areas, Proceedings of the Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 2018 (with M. Friedenberg).
Towards formal definitions of blameworthiness, intention, and moral responsibility, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 2018 (with M. Kleiman-Weiner).
Blameworthiness in multi-agent settings, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 2019 (with M. Friedenberg).
Abstracting causal models, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 2019 (with S. Beckers).
Approximate causal abstration, Proceedings of the 35th Conference on Uncertainty in AI (UAI 2019), 2019 (with S. Beckers and F. Eberhardt).
Probabilistic and Causal Inference: The Works of Judea Pearl, ACM Press, 2022 (with H. Geffner and R. Dechter).
Predicting responsibility judgments from dispositional inferences and causal attributions, Cognitive Psychology 129, 2021 (with A. F. Langenhoff, A. Wiegmann, J. B. Tenenbaum, and T. Gerstenberg).
On testing for discrimination using causal models, Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI-21), 2022 (with H. Chockler).
Reasoning about causal models with infinitely many variables, Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI-21), 2022 (with S. Peters).
A causal analysis of harm, Proceedings of the 36th Conference on Neural Information Processing Systems (NeurIPS 2022), 2022, pp. 2365-2376 (with S. Beckers and H. Chockler).
Causal models with constraints, Proceedings of the Second Conference on Causal Learning and Reasoning, 2023 (with S. Beckers and C. Hitchock).
Quantifying harm, Proceedings of the Thirty-Sevenh AAAI Conference on Artificial Intelligence (AAAI-23), 2022, pp. 2365-2376 (with S. Beckers and H. Chockler).

Evidence

Two views of belief: belief as generalized probability and belief as evidence, Artificial Intelligence 54, 1992, pp. 275-317 (with R. Fagin).
A logic for reasoning about evidence Journal of AI Research 26, 2006, pp. 1-34, (with R. Pucella).
Evidence with uncertain likelihoods, Synthese 171:1, 2009, pp. 111-133 (with R. Pucella).

Belief Change

Modeling belief in dynamic systems. Part I: Foundations, Artificial Intelligence 95:2, 1997, pp. 257-316 (with N. Friedman).
Modeling belief in dynamic systems. Part II: Revision and Update, Journal of AI Research 10, 1999, pp. 117-167 (with N. Friedman).
On the complexity of conditional logics, Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR '94), 1994, pp. 202-213 (with N. Friedman).
Conditional logics of belief change, AAAI-94 (Proceedings of the Twelfth National Conference on Artificial Intelligence), 1994, pp. 915-921 (with N. Friedman).
First-order conditional logic for default reasoning revisited, ACM Transactions on Computational Logic 1:2 2000, pp. 175-207 (with N. Friedman and D. Koller).
A qualitative Markov assumption and its implications for belief change, Proceedings of the Twelfth Conference on Uncertainty in AI, 1996, pp. 263-273 (with N. Friedman).
Belief revision: a critique, Journal of Logic, Language, and Information 8, 1999, pp. 401-420 (with N. Friedman).
Belief revision with unreliable observations, AAAI-98 (Proceedings of the Fifteenth National Conference on Artificial Intelligence), 1998, pp. 127-134 (with C. Boutilier and N. Friedman).

Nonmonotonic Reasoning, Default Reasoning, and Only Knowing

Towards a theory of knowledge and ignorance, in Proceedings of the Workshop on Non-Monotonic Reasoning, 1984, pp. 125-143 (with Y. Moses).
Statistical foundations for default reasoning, Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93), 1993, pp. 563-569 (with F. Bacchus, A. J. Grove, and D. Koller).
Levesque's axiomatization of only knowing is incomplete, Artificial Intelligence 74:2, 1995, pp. 381-387 (with G. Lakemeyer).
Multi-agent only knowing, Journal of Logic and Computation 11:1, 2001, pp. 41-70 (with G. Lakemeyer).
Plausibility measures and default reasoning, Journal of the ACM 48:4, 2001, pp. 648-685 (with N. Friedman)
First-order conditional logic for default reasoning revisited, ACM Transactions on Computational Logic 1:2, 2000, pp. 175-207 (with N. Friedman and D. Koller).
A theory of knowledge and ignorance for many agents, Journal of Logic and Computation 7:1, 1997, pp. 79-108.
A critical reexamination of default logic, autoepistemic logic, and only knowing, Computational Intelligence 13:1, 1997, pp. 144-163.
Plausibility measures and default reasoning: an overview (invited talk), Proceedings of the 14th IEEE Symposium on Logic in Computer Science, 1999, pp. 130-135 (with N. Friedman).
From qualitative to quantitative proofs of security properties using first-order conditional logic, Journal of Computer Security 25, 2017, pp. 1-19.
Defaults and normality in causal structures, Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), 2008, pp. 198-208.
A conceptually well-founded characterization of iterated admissibility using an ``all I know'' operator, Proceedings of Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science, 2019 (with R. Pass).

Modal Logic

Deterministic propositional dynamic logic: finite models, complexity, and completeness, Journal of Computer and Systems Science 25:3, 1982, pp. 402-417 (with M. Ben-Ari and A. Pnueli).
On the expressive power of nondeterminism in dynamic logic, Proceedings of the 9th International Colloquium on Automata, Languages, and Programming, 1982, pp. 48-60 (with P. Berman and J. Tiuryn).
The propositional dynamic logic of deterministic, well-structured programs, Theoretical Computer Science 27, 1983, pp. 127-165 (with J. H. Reif).
Deterministic process logic is elementary, Information and Control 57:1, 1983, pp. 56-89.
A hardware semantics based on temporal intervals, Proceedings of the 10th International Colloquium on Automata, Languages, and Programming, 1983, pp. 278-291 (with B. Moszkowski and Z. Manna).
Decision procedures and expressiveness in the temporal logic of branching time, Journal of Computer and Systems Science 30:1, 1985, pp. 1-24 (with E. A. Emerson).
Equations between regular terms and an application to process logic, SIAM J. Computing 14:4, 1985, pp. 935-942 (with A. Chandra, A. R. Meyer, and R. Parikh).
``Sometimes'' and ``not never'' revisited: on branching vs. linear time, Journal of the ACM 33:1, 1986, pp. 151-178 (with E. A. Emerson).
A logic to reason about likelihood, Artificial Intelligence 32:3, 1987, pp. 379-405 (with M. O. Rabin).
The complexity of reasoning about knowledge and time, I: lower bounds, Journal of Computer and Systems Science 38:1, 1989, pp. 195-237 (with M. Y. Vardi).
Likelihood, probability, and knowledge, Computational Intelligence 5, pp. 151-160, 1989 (with D. A. McAllester).
A logic for reasoning about probabilities, Information and Computation 87:1,2, 1990, pp. 78-128 (with R. Fagin and N. Megiddo)
An analysis of first-order logics of probability, Artificial Intelligence 46, 1990, pp. 311-350.
The relationship between knowledge, belief, and certainty, Annals of Mathematics and Artificial Intelligence 4, 1991, pp. 301-322.
A model-theoretic analysis of knowledge, Journal of the ACM 38:2, 1991, pp. 382-428 (with R. Fagin and M. Y. Vardi).
A propositional modal interval logic, Journal of the ACM 38:4, 1991, pp. 935-962 (with Y. Shoham).
Model checking vs. theorem proving: a manifesto, Artificial Intelligence and Mathematical Theory of Computation (Papers in Honor of John McCarthy) (ed. V. Lifschitz), Academic Press, 1991, pp. 151-176 (with M. Vardi).
What can machines know? On the properties of knowledge in distributed systems, Journal of the ACM 39:2, 1992, pp. 328-376 (with R. Fagin and M. Y. Vardi).
A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54, 1992, pp. 319-379 (with Y. Moses).
What is an inference rule?, Journal of Symbolic Logic 57:3, 1992, pp. 1018-1045 (with R. Fagin and M. Y. Vardi).
Naming and identity in epistemic logics, I: The propositional case, Journal of Logic and Computation 3:4, 1993, pp. 345-378 (with A. J. Grove).
Reasoning about knowledge and probability, Journal of the ACM 41:2, 1994, pp. 340-367 (with R. Fagin).
Decidability and expressiveness for first-order logics of probability, Information and Computation 112:1, 1994, pp. 1-36 (with M. Abadi).
Zero-one laws for modal logic, Annals of Pure and Applied Logic 69, 1994, pp. 157-193 (with B. M. Kapron).
On the complexity of conditional logics, Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR '94), 1994, pp. 202-213 (with N. Friedman).
Conditional logics of belief change, AAAI-94 (Proceedings of the Twelfth National Conference on Artificial Intelligence), 1994, pp. 915-921 (with N. Friedman).
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic, Artificial Intelligence 75:2, 1995, pp. 361-372.
Levesque's axiomatization of only knowing is incomplete, Artificial Intelligence 74:2, 1995, pp. 381-387 (with G. Lakemeyer).
A nonstandard approach to the logical omniscience problem, Artificial Intelligence 79:2, 1995, pp. 203-240 (with R. Fagin and M. Y. Vardi).
Should knowledge entail belief?, Journal of Philosophical Logic 25:5, 1996, pp. 483-494.
Common knowledge revisited, Annals of Pure and Applied Logic 96, 1999, pp. 89-105. (with R. Fagin, Y. Moses, and M. Y. Vardi).
Plausibility measures and default reasoning, Journal of the ACM 48:4, 2001, pp. 648-685 (with N. Friedman).
First-order conditional logic for default reasoning revisited, ACM Transactions on Computational Logic 1:2, 2000, pp. 175-207 (with N. Friedman and D. Koller).
On the adequacy of modal logic, Electronic News Journal on Reasoning about Action and Change 3, July 1999.
A theory of knowledge and ignorance for many agents, Journal of Logic and Computation 7:1, 1997, pp. 79-108.
Complete axiomatizations for reasoning about knowledge and time, SIAM Journal on Computing 33:2, 2004, pp. 674-703 (with R. van der Meyden, and M. Y. Vardi)
Defining relative likelihood in partially-ordered preferential structures, Journal of AI Research 7, 1997, pp. 1-24. April, 1997
Set-theoretic completeness for epistemic and conditional logic, Annals of Mathematics and Artificial Intelligence 26, 1999, pp. 1-27.
Hypothetical knowledge and counterfactual reasoning, International Journal of Game Theory 28:3, 1999, pp. 315-330.
The hierarchical approach to modeling knowledge and common knowledge, International Journal of Game Theory 28:3, 1999, pp. 331-365 (with R. Fagin, J. Geanakoplos, and M. Y. Vardi).
Characterizing the common prior assumption, Journal of Economic Theory 106:2, 2002, pp. 316-355.
Axiomatizing causal reasoning, Journal of AI Research 12, 2000, pp. 317-337.
Reasoning about common knowledge with infinitely many agents, Information and Computation 191:1, 2004, pp. 1-40 (with R. Shore).
A logic for SDSI's linked local named spaces, Journal of Computer Security 9:1,2, 2001, pp. 47-74 (with R. van der Meyden).
Alternative semantics for unawareness, Games and Economic Behavior 37, 2001, pp. 321-339.
A logical reconstruction of SPKI, Journal of Computer Security 11:4, 2003, pp. 581-614 (with R. van der Meyden).
A logic for reasoning about upper probabilities, Journal of AI Research 17, pp. 57-81, 2002 (with R. Pucella).
Characterizing and reasoning about probabilistic and non-probabilistic expectation, Journal of the ACM 54:3, 2007 (with R. Pucella).
Complete axiomatizations for reasoning about knowledge and time, SIAM Journal on Computing 33:2, 2004, pp. 674-703 (with R. van der Meyden and M. Vardi).
Interactive awareness revisited, Games and Economic Behavior 62:1, 2008, pp. 232-262 (with L. Rego)
Reasoning about knowledge of unawareness, Games and Economic Behavior 67:2, 2009, pp. 503-525 (with L. Rego)
Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic, Journal of Logic and Computation 17:4, pp. 795-806, 2007 (with L. Rego).
Dealing with logical omniscience, Artificial Intelligence 175:1, 2011, pp. 220-235 (with R. Pucella).
On definability in multimodal logic, Review of Symbolic Logic 2:3, 2009, (with D. Samet and E. Segev).
Defining knowledge in terms of belief: the modal logic perspective, Review of Symbolic Logic (with D. Samet and E. Segev).
A logical characterization of iterated admissibility, Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 146-155 (with R. Pass).
An epistemic characterization of zero knowledge, Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 156-165 (with R. Pass and V. Raman).
Reasoning about knowledge of unawareness revisited, Games and Economic Behavior 67:2, 2009, pp. 503-525 (with L. C. Rego).
Awareness in games, awareness in logic, Proceedings of LPAR-17 Lecture Notes in Computer Science, vol. 6397, Springer, 2010, p. 15.
Conservative belief and rationality, Games and Economic Behavior 80, pp. 186-192 (with R. Pass).
Reasoning about justified belief, Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2011, pp. 221-227 (with A. Bjorndahl and R. Pass).
Ambiguous language and differences in beliefs, Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), 2012, pp. 329-338 (with W. Kets).
A logic for reasoning about ambiguity, Artificial Intelligence 209, 2014 (with W. Kets).
Reasoning about rationality, Games and Economic Behavior 104, 2017, pp. 146-164 (with A. Bjorndahl and R. Pass).
An introduction to logics of knowledge and belief, in Handbook of Epistemic Logic (H. van Ditmarsch, J. Y. Halpern, W. van der Hoek, and B. Kooi, editors), College Publications, 2015, pp. 1-51.
A knowledge-based analysis of the blockchain protocol, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 324-335 (with R. Pass).
Why bother with syntax?, Rohit Parikh on Logic, Language and Society (C. Baskent, L. Moss, and R. Ramanujam, editors), 2017, pp. 111-119.
Partial Awareness, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 201 (with E. Piermont).
Dynamic partial awareness, Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020 (with E. Piermont).
A conceptually well-founded characterization of iterated admissibility using an ``all I know'' operator, Proceedings of Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science, 2019 (with R. Pass).
Reasoning about causal models with infinitely many variables, Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI-21), 2022 (with S. Peters).
Joint behavior and common belief, Proceedings of Ninteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 379, 2023, pp. 221-232.

Distributed Computing

Using reasoning about knowledge to analyze distributed systems, in Annual Reviews of Computer Science, Vol. 2 (ed. J. F. Traub, B. J. Grosz, B. W. Lampson, and N. J. Nilsson), Annual Reviews Inc., 1987, pp. 37-68.
Optimal precision in the presence of uncertainty, Journal of Complexity 1, 1985, pp. 170-196 (with N. Megiddo and A. Munshi).
On the possibility and impossibility of achieving clock synchronization, Journal of Computer and Systems Science 32:2, 1986, pp. 230-250, (with D. Dolev and H. R. Strong).
Cheating husbands and other stories: a case study in knowledge, action, and communication, Distributed Computing 1:3, 1986, pp. 167-176 (with D. Dolev and Y. Moses).
A new look at fault-tolerant network routing, Information and Computation 72:3, 1987, pp. 180-196 (with D. Dolev, B. Simons, and H. R. Strong).
Modelling knowledge and action in distributed systems, Distributed Computing 3:4, 1989, pp. 159-177 (with R. Fagin).
Knowledge and common knowledge in a distributed environment, Journal of the ACM 3:3, 1990, pp. 549-587 (with Y. Moses).
A characterization of eventual Byzantine agreement, SIAM Journal on Computing 31:3, 2001, pp. 838-865 (with Y. Moses and O. Waarts).
Clock synchronization and the power of broadcasting, Distributed Computing 5:2, 1991, pp. 73-83 (with I. Suzuki).
A note on knowledge-based protocols and specifications, Distributed Computing 13:3, 2000, pp. 145-153.
Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory 26, 1993, pp. 41-102 (with V. Hadzilacos).
The failure discovery problem, Mathematical Systems Theory 26, 1993, pp. 103-129 (with V. Hadzilacos).
Knowledge, probability, and adversaries, Journal of the ACM 40:4, pp. 917-962, 1993 (with M. Tuttle).
Dynamic fault-tolerant clock synchronization, Journal of the ACM 42:1, 1995, pp. 143-185 (with B. Simons, H. R. Strong, and D. Dolev).
Performing work efficiently in the presence of faults, SIAM Journal on Computing 27:5, 1998, pp. 1457-1491 (with C. Dwork and O. Waarts).
Knowledge-based programs, Distributed Computing 10:4, 1997, pp. 199-225 (with R. Fagin, Y. Moses, band M. Y. Vardi).
Using counterfactuals in knowledge-based programming, Distributed Computing 17:2, pp. 91-106 (with Y. Moses).
A decision-theoretic approach to reliable message delivery, Distributed Computing 14, 2001, pp. 1-16 (with F. Chu).
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors, Distributed Computing 17:3, 2005, pp. 223-236 (with A. Ricciardi).
A computer scientist looks at game theory, Games and Economic Behavior 45:1, 2003, pp. 114-131.
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006, pp. 53-62 (with I. Abraham, D. Dolev, and R. Gonen).
A knowledge-based analysis of global function computation, Distributed Computing 23:3, 2010, pp. 197-224. (with S. Petride).
Lower bounds on implementing robust and resilient mediators, Proceedings of the Fifth Theory of Cryptography Conference, 2008, pp. 302-319 (with I. Abraham and D. Dolev).
An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008, pp. 405-414 (with I. Abraham and D. Dolev).
The Lotus-eater attack, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008, p. 455 (with I. Kash and E. J. Friedman).
Knowledge-based synthesis of distributed systems using event structures, Logical Methods in Computer Science 7:2, 2011 (with M. Bickford, R. L. Constable, J. Y. Halpern, and S. Petride)
Distributed computing meets game theory: combining insights from two fields, ACM SIGACT News 42:2, 2011, pp. 69-76 (with I. Abraham and L. Alvisi).
No justified complaints: on fair sharing of multiple resources, Proceedings of 3rd Conference on Innovations in Theoretical Computer Science (ITCS 2012), 2012 (with D. Dolev, D. Feitelson, R. Kupferman, and N. Linial).
Distributed protocols for leader election: a game-theoretic perspective, ACM Transactions on Economics and Computation, 2019, to appear (with I. Abraham and D. Dolev).
Rational consensus, Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing, 2016, pp. 137-146 (with X. Vilaca).
A knowledge-based analysis of the blockchain protocol, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 324-335 (with R. Pass).
Implementing mediators with asynchronous cheap talk, Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing, 2019, pp. 501-510 (with I. Abraham, D. Dolev, and I. Geffner).
Security in asynchronous interactive systems, Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2021 (with I. Geffner).
Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents, Journal of the ACM 70:2, 2023, pp. 1-20 (with I. Geffner).
Optimal eventual Byzantine agreement protocols with omission failures, Proceedings of the 42nd Annual ACM Symposium on Principles of Distributed Computing, 2023, pp. 244-252 (with K. Alpturer and R. van der Meyden).
Colordag: an incentive-compatible blockchain, Proceedings of the International Symposium on Distributed Computing (DISC 2023), 2023 (with I. Abraham, D. Dolev, and I. Eyal).

Game Theory

On ambiguities in the interpretation of game trees, Games and Economic Behavior 20, 1997, pp. 66-96.
On the expected value of games with absentmindedness, Games and Economic Behavior 20, 1997, pp. 51.-65 (with A. Grove).
Hypothetical knowledge and counterfactual reasoning, International Journal of Game Theory 28:3, 1999, pp. 315-330.
The hierarchical approach to modeling knowledge and common knowledge, International Journal of Game Theory 28:3, 1999, pp. 331-365 (with R. Fagin, J. Geanakoplos, and M. Y. Vardi).
Substantive rationality and backward induction Games and Economic Behavior 37, 2001, pp. 425-435.
Alternative semantics for unawareness, Games and Economic Behavior 37, 2001, pp. 321-339.
On the NP-completeness of finding an optimal strategy in games with common payoffs, International Journal of Game Theory 30:1, 2001, pp. 99-106 (with F. Chu).
Characterizing the common prior assumption, Journal of Economic Theory 106:2, 2002, pp. 316-355.
A computer scientist looks at game theory, Games and Economic Behavior 45:1, 2003, pp. 114-131.
Rational secret sharing and multiparty computation, Proceedings of 36th ACM Symposium on Theory of Computing, 2004, pp. 623-632 (with V. Teague).
On spectrum sharing games, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004, p. 107-114 (with M. M. Halldorsson, L. Li, and V. Mirrokni).
Efficiency and Nash equilibria in a scrip system for P2P networks, Proceedings of the Seventh ACM Conference on Electronic Commerce, 2006, pp. 140-149 (with E. Friedman and I. Kash).
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006, pp. 53-62 (with I. Abraham, D. Dolev, and R. Gonen).
Interactive awareness revisited, Games and Economic Behavior 62:1, 2008, pp. 232-262 (with L. Rego).
Computer science and game theory: A brief survey, Palgrave Dictionary of Economics (S. N. Durlauf and L. E. Blume, eds.), Palgrave MacMillan, 2008.
Toward expressive and scalable sponsored search auctions, Proceedings of the 24th International Conference on Data Engineering, 2008, pp. 237-246 (with D. J. Martin and J. Gehrke).
Lower bounds on implementing robust and resilient mediators, Proceedings of the Fifth Theory of Cryptography Conference, 2008, pp. 302-319 (with I. Abraham and D. Dolev).
A game-theoretic analysis of updating sets of probabilities, Proceedings of the Twenty-Fourth Conference on Uncertainty in AI, 2008, pp. 240-247 (with P. Grunwald).
Reasoning about knowledge of unawareness, Games and Economic Behavior 67:2, 2009, pp. 503-525 (with L. Rego).
Shared winner determination in sponsored search auctions, Proc. 25th International Conference on Data Engineering, 2009, pp. 270-280 (with D. J. Martin and J. Gehrke).
A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium , International Journal of Game Theory 3838:1, 2009, pp. 37-50.
Manipulating scrip systems: sybils and collusion, Proceedings of the First Conference on Auctions, Market Mechanisms, and Multiagent Systems (AMMA), 2009 (with I. A. Kash and E. J. Friedman).
A logical characterization of iterated admissibility, Proceedings of Twelfth Conference on Theoretical Aspects of Rationality and Knowledge, 2009, pp. 146-155 (with R. Pass).
Lexicographic probability, conditional probability, and nonstandard probability, Games and Economic Behavior 68:1, 2010, pp. 155-179.
Game theory with costly computation, First Symposium on Innovations in Computer Science, 2010, pp. 120-142 (with R. Pass).
Cooperative equilibrium, Proceedings of the Ninth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010, pp. 1465-1466 (with N. Rong).
Awareness in games, awareness in logic, Proceedings of LPAR-17 Lecture Notes in Computer Science, vol. 6397, Springer, 2010, p. 15.
Algorithmic rationality: Adding cost of computation to game theory, SIGECOM Exchanges 10.2, 2011 pp. 9-15 (with R. Pass).
Beyond Nash equilibrium: Solution concepts for the 21st century, Lectures in Game Theory for Computer Scientists (K. R. Apt and E. Gradel, editors), Cambridge University Press, 2011, pp. 264-289. (An earlier version appears in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008, pp. 1-10, and was reprinted in Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), 2008, pp. 219-228.)
Reasoning about justified belief, Proceedings of the Thirteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2011, pp. 221-227 (with A. Bjorndahl and R. Pass).
Distributed computing meets game theory: combining insights from two fields, ACM SIGACT News 42:2, 2011, pp. 69-76 (with I. Abraham and L. Alvisi).
Multiagent learning in large anonymous games, Journal of AI Research 40, 2011, pp. 571-598 (with I. A. Kash and E. J. Friedman).
A computational game-theoretic framework for cryptography, unpublished manuscript, 2011 (with R. Pass).
No justified complaints: on fair sharing of multiple resources, Proceedings of 3rd Conference on Innovations in Theoretical Computer Science (ITCS 2012), 2012 (with D. Dolev, D. Feitelson, R. Kupferman, and N. Linial).
Generalized solution concepts in games with possibly unaware players, International Journal of Game Theory :1, 2012, pp. 131-155 (with L. C. Rego).
Ambiguous language and differences in beliefs, Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), 2012, pp. 329-338 (with W. Kets).
Iterated regret minimization: A more realistic solution concept, Games and Economic Behavior 74:1, 2012, pp. 194-207 (with R. Pass).
Optimizing scrip systems: efficiency, crashes, hoarders, and altruists, Distributed Computing 25:25, 2012, pp. 335-357 (with I. A. Kash and E. J. Friedman).
Reasoning about knowledge of unawareness revisited, Mathematical Social Sciences 66:2, 2013, pp. 73-84 (with L. C. Rego).
Language-based games, Proceedings of the Fourteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2013, pp. 39-48 (with A. Bjorndahl and R. Pass).
Game theory with translucent players, International Journal of Game Theory 47:3, 2018, pp. 949-976 (with R. Pass).
Distributed protocols for leader election: a game-theoretic perspective, ACM Transactions on Economics and Computation, 2019, to appear (with I. Abraham and D. Dolev).
Conservative belief and rationality, Games and Economic Behavior 80, 2013, pp. 186-192 (with R. Pass).
Towards a deeper understanding of cooperative equilibrium: characterization and complexity Proceedings of the Twelfth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013), 2013, pp. 319-326 (with N. Rong).
Sequential equilibrium in computational games, ACM Transactions on Economics and Computation 7:2, 2019 (with R. Pass).
Extensive games with possibly unaware players, Mathematical Social Sciences 70, 2014, pp. 42-58 (with L. Rego).
The truth behind the myth of the folk theorem, Games and Economic Behavior, Games and Economic Behavior 117, 2019, pp. 479-498 (with R. Pass and L. Seeman).
A logic for reasoning about ambiguity, Artificial Intelligence 209, pp. 1-10, 2014 (with W. Kets).
Reasoning about rationality, Games and Economic Behavior 104, 2017, pp. 146-164 (with A. Bjorndahl and R. Pass).
Conditional belief types, Games and Economic Behavior 87, 2014 pp. 253-268 (with A. Di Tillio and D. Samet).
A procedural characterization of solution concepts in games, Journal of AI Research 49, 2014, pp. 143-170 (with Y. Moses).
Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players, Proceedings of WINE 2014: 10th Conference on Web and Internet Economics, 2014, pp. 249-262 (with L. Seeman and R. Pass).
Ambiguous language and common priors, Games and Economic Behavior 90, 2015, pp. 171-180 (with W. Kets).
An equilibrium analysis of scrip systems, ACM Transactions on Economics and Computation, 3:3, 2015 (with E. Friedman and I. Kash).
Translucent players: explaining cooperative behavior in social dilemmas, Rationality and Society 31, 2019, pp. 371-408 (with V. Capraro).
Algorithmic rationality: game theory with costly computation, Journal of Economic Theory 156, 2015, pp. 246-268. 2015 (with R. Pass).
Bayesian games with intentions, Games and Economic Behavior 123, 2020, pp. 54-67 (with A. Bjorndahl and R. Pass).
Sequential equilibrium in games of imperfect recall , ACM Transactions on Economics and Computation 9:4, 2021 (with R. Pass).
Incentive-compatible mechanisms for norm monitoring in open multi-agent systems, Journal of AI Research 62, 2018,pp. 433-459 (with N. Alechina, I. Kash, and B. Logan).
Characterizing solution concepts in terms of common knowledge of rationality, International Journal of Game Theory 46:2, 2017, pp. 457-473 (with Y. Moses).
Computational extensive-form games, Proceedings of the 17th Conference on Electronic Commerce, 2016, pp. 668-698 (with L. Seeman and R. Pass).
Rational consensus, Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing, 2016 (with X. Vilaca).
Incentivising monitoring in open normative systems, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 2017, pp. 305-311 (with N. Alechina, J. Y. Halpern, I. Kash, and B. Logan).
Games with tolerant players, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 251-264 (with A. Ghosh).
From type spaces to probability frames and back, via language, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 75-87 (with A. Bjorndahl).
Why bother with syntax?, Rohit Parikh on Logic, Language and Society (C. Baskent, L. Moss, and R. Ramanujam, editors), 2017, pp. 111-119.
A conceptually well-founded characterization of iterated admissibility using an ``all I know'' operator, Proceedings of Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science, 2019 (with R. Pass).
On the existence of Nash Equilibrium in games with resource-bounded players?, Proceedings of the 12th International Symposium on A Game Theory (SAGT)} 2019, pp. 139-152 (with R. Pass and D. Reichman).
Implementing mediators with asynchronous cheap talk, Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing, 2019, pp. 501-510 (with I. Abraham, D. Dolev, and I. Geffner).
From outcome-based to language-based preferences, to appear, Journal of Economic Literature (with V. Capraro and M. Perc).
Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents, Journal of the ACM 70:2, 2023, pp. 1-20 (with I. Geffner).
Strategic play by resource-bounded agents in security games, Proceedings of the 22nd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), pp. 2478-2480 (with X. Liu).

Decision Theory

Least expected cost query optimization: an exercise in utility, Proceedings of the 18th ACM Symposium on Principles of Database Systems, 1999, pp. 138-147 (with F. Chu and P. Seshadri).
A decision-theoretic approach to resource allocation in wireless multimedia networks, Proceedings of Dial M for Mobility, 2000, pp. 86-95 (with Z. Haas, L. Li, and S. B. Wicker).
A decision-theoretic approach to reliable message delivery, Distributed Computing 14, 2001, pp. 1-16 (with F. Chu).
Least expected cost query optimization: What can we expect?, Proceedings of the 21st ACM Symposium on Principles of Database Systems, 2002, pp. 293-302 (with F. Chu and J. Gehrke).
Great expectations. Part II: Generalized expected utility as a universal decision rule, Artificial Intelligence 159:1,2, 2004, pp. 207-230 (with F. Chu).
Constructive decision theory, Journal of Economic Theory 196, 2021 (with L. Blume and D. Easley).
Great expectations. Part I: On the customizability of generalized expected utility, Theory and Decision, 64:1, 2008, pp. 1-36 (with F. Chu).
Intransitivity and vagueness, Review of Symbolic Logic 1:4, 2009, pp. 530-547.
I don't want to think about it now: Decision theory with costly computation, Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR 2010), 2010 (with R. Pass).
MDPs with unawareness, Proceedings of the Twenty-Sixth Conference on Uncertainty in AI, 2010, pp. 228-235 (with N. Rong and A. Saxena).
Making decisions using sets of probabilities: updating, time consistency, and calibration, Journal of AI Research 42, 2011, pp. 393-426 (with P. D. Grunwald). An earlier version, A game-theoretic analysis of updating sets of probabilities appears in Proceedings of the Twenty-Fourth Conference on Uncertainty in AI, 2008, pp. 240-247.
Iterated regret minimization: A more realistic solution concept, Games and Economic Behavior 74:1, 2012, pp. 194-207 (with R. Pass).
Weighted sets of probabilities and minimax weighted expected regret: new approaches for representing uncertainty and making decisions, Theory and Decision 79:3, 2015, pp. 415-450 (with S. Leung).
I'm doing as well as I can: modeling people as rational finite automata, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12), 2012, pp. 1917-1923 (with R. Pass and L. Seeman).
Decision theory with resource-bounded agents. Topics in Cognitive Science 6:2, 2014, pp. 245-257 (with R. Pass and L. Seeman).
Reasoning about rationality, Games and Economic Behavior 104, 2017, pp. 146-164 (with A. Bjorndahl and R. Pass).
Maxmin weighted expected utility: a simpler characterization, Theory and Decision 80:4, 2016, pp. 581-610 (with S. Leung).
Minimizing regret in dynamic decision problems, Theory and Decision 811, 2016, pp. 123-151 (with S. Leung).
MDPs with unawareness in robotics, Proceedings of the 32nd Conference on Uncertainty in AI, 2016, pp. 626-636 (with N. Rong and A. Saxena).
Is state-dependent valuation more adaptive than simpler rules?, Behavioural Processes 147, 2018, pp. 33-37 (with L. Seeman).
A note on the existence of ratifiable acts, Review of Symbolic Logic 13:3, 2018, pp. 503-508.
Partial awareness, Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 2019 (with E. Piermont).
Dynamic partial awareness, Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020 (with E. Piermont).
Bounded rationality in Las Vegas: finite automata play multi-armed bandit, In Proceedings of the 36th Conference on Uncertainty in AI (UAI 2020), 2020 (with X. Liu).
Language-based decisions, Proceedings of Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science, 2021 (with A. Bjorndahl).
From outcome-based to language-based preferences, to appear, Journal of Economic Literature (with V. Capraro and M. Perc).
Sequential language-based decisions, Proceedings of Ninteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 379, 2023, pp. 131-141 (with A. Bjorndahl).

Program Verification and Functional Programming

Axiomatic definitions of programming languages: a theoretical assessment, Journal of the ACM 29:2, April, 1982, pp. 555-576 (with A. R. Meyer).
Axiomatic definitions of programming languages, II, Proceedings of 8th Annual ACM Symposium on Principles of Programming Languages, 1981, pp. 139-148 (with A. R. Meyer).
Deterministic propositional dynamic logic: finite models, complexity, and completeness, Journal of Computer and Systems Science 25:3, 1982, pp. 402-417 (with M. Ben-Ari and A. Pnueli).
On the expressive power of nondeterminism in dynamic logic, Proceedings of the 9th International Colloquium on Automata, Languages, and Programming, 1982, pp. 48-60 (with P. Berman and J. Tiuryn).
The propositional dynamic logic of deterministic, well-structured programs, Theoretical Computer Science 27, 1983, pp. 127-165 (with J. H. Reif).
Effective axiomatizations of Hoare Logics, Journal of the ACM 30:3, 1983, pp. 612-637 (with E. M. Clarke and S. M. German).
Deterministic process logic is elementary, Information and Control 57:1, 1983, pp. 56-89.
From denotational to operational and axiomatic semantics for Algol-like languages: an overview, Proceedings of CMU Logics of Programs Conference, Lecture Notes in Computer Science, 1983, pp. 474-500 (with B. A. Trakhtenbrot and A. R. Meyer).
A hardware semantics based on temporal intervals, Proceedings of the 10th International Colloquium on Automata, Languages, and Programming, 1983, pp. 278-291 (with B. Moszkowski and Z. Manna).
The semantics of local storage, or what makes the free-list free?, Proceedings of the 11th Annual ACM Symposium on the Principles of Programming Languages, 1984, pp. 245-257 (with B. A. Trakhtenbrot and A. R. Meyer).
A good Hoare axiom system for an Algol-like language, Proceedings of the 11th Annual ACM Symposium on the Principles of Programming Languages, 1984, pp. 262-271.
Decision procedures and expressiveness in the temporal logic of branching time, Journal of Computer and Systems Science 30:1, 1985, pp. 1-24 (with E. A. Emerson).
``Sometimes'' and ``not never'' revisited: on branching vs. linear time, Journal of the ACM 33:1, 1986, pp. 151-178 (with E. A. Emerson).
Reasoning about procedures as parameters in the language L4, Information and Computation 83:3, 1989, pp. 265-359 (the whole volume) (with S. M. German and E. M. Clarke).
Completeness of rewrite rules and rewrite strategies for FP, Journal of the ACM 37:1, 1990, pp. 86-143 (with J. H. Williams and E. L. Wimmers).
A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols, Journal of the ACM 39:3, 1992, pp. 449-478 (with L. Zuck).
Full abstraction and expressive completeness for FP, Information and Computation 118:2, 1995, pp. 246-271 (with E. L. Wimmers).
What causes a system to satisfy a specification?, ACM Transactions on Computational Logic 9:3, 2008 (with H. Chockler and O. Kupferman).

Security

A logic for SDSI's linked local named spaces, Journal of Computer Security 9:1,2, 2001, pp. 47-74 (with R. van der Meyden).
A logical reconstruction of SPKI, Journal of Computer Security 11:4, 2003, pp. 581-614 (with R. van der Meyden).
On the relationship between strand spaces and multi-agent systems, ACM Transactions on Information and System Security 6:1, pp. 43-70, 2003 (with R. Pucella)
Secrecy in multi-agent systems, ACM Transactions on Information and System Security 12:1, 2008, (with K. O'Neill).
Modeling adversaries in a logic for security protocol analysis, Logical Methods in Computer Science 8:1, 2012 (with R. Pucella).
Anonymity and information hiding in multiagent systems, Journal of Computer Security 13:3, 2005, pp. 483-514 (with K. O'Neill).
Using first-order logic to reason about policies, ACM Transactions on Information and System Security 11:4, 2008 (with V. Weissman).
Probabilistic algorithmic knowledge Logical Methods in Computer Science 1:3, 2005 (with R. Pucella).
A formal foundation for XrML, Journal of the ACM 55:1, 2008 (with V. Weissman).
Worst-case background knowledge, Proceedings of the 23rd International Conference on Data Engineering, 2007, pp. 126-135 (with D. J. Martin, D. Kifer, A. Machanavajjhala, and J. Gehrke).
From qualitative to quantitative proofs of security properties using first-order conditional logic, Journal of Computer Security 25, 2017, pp. 1-19.
Expressing security properties using selective interleaving functions, unpublished manuscript, 2007 (with S. Petride).
A computational game-theoretic framework for cryptography, unpublished manuscript, 2011 (with R. Pass).
An epistemic foundation for authentication logics, Proceedings of Sixteenth Conference on Theoretical Aspects of Rationality Knowledge (TARK), Electronic Proceedings in Theoretical Computer Science 251, 2017, pp. 306-323 (with R. van der Meyden and R. Pucella).
Security in asynchronous interactive systems, Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2021 (with I. Geffner).

Networks

Sensor-assisted mutiple-access protocols for wireless networks, Proceedings of the 1998 International International Conference on Universal Personal Communications, 1998, (with T. Fine, S. B. Wicker, and T. Berger).
Sensor-assisted ALOHA for wireless networks, Proceedings of the 1998 International Symposium on Information Theory, 1998, p. 161 (with T. Fine, S. B. Wicker, and T. Berger).
A decision-theoretic approach to resource allocation in wireless multimedia networks, Proceedings of Dial M for Mobility, 2000, pp. 86-95 (with Z. Haas, L. Li, and S. B. Wicker).
A minimum-energy path-preserving topology-control algorithm, IEEE Transactions on Wireless Communications 3:3, 2004, pp. 910-921 (with L. Li).
A cone-based distributed topology-control algorithm for wireless multi-hop networks, IEEE/ACM Transactions on Networks 13:1, 2005, pp. 147-159 (with L. Li, P. Bahl, Y.-M. Wang, and R. Wattenhofer).
Gossip-based ad hoc routing, IEEE/ACM Transactions on Networking 14:3, 2006, pp. 479-491 (with Z. Haas and L. Li).

Miscellaneous Papers

On time versus space III, Math. Systems Theory 19, 1986, pp. 13-28 (with M. C. Loui, A. R. Meyer, and D. Weise).
Taken by surprise: the paradox of the surprise test revisited, Journal of Philosophical Logic 15:3, 1986, pp. 281-304 (with Y. Moses).
Presburger arithmetic with unary predicates is complete, Journal of Symbolic Logic 56:2, 1991, pp. 637-642.
A logic for approximate reasoning, Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 1992, pp. 153-164 (with D. Koller).
A data-acquisition model for learning and cognitive development and its implications for autism, unpublished manuscript, 2004 (with A. Lotem).
The Computing Research Repository: promoting the rapid dissemination and archiving of computer science, Proceedings of ACM Digital Libraries '99, 1999, pp. 3-11 (with C. Lagoze).
CoRR: A Computing Research Repository (with commentary), ACM Journal of Computer Documentation 24:2, 2000, pp. 41-48; my response to the commentators is on pp. 72-77.
Intransitivity and vagueness, Review of Symbolic Logic 1:4, 2009, pp. 530-547.
Joseph Y. Halpern, in Epistemology: 5 Questions (ed. V. F Hendricks and D. Pritchard), Automatic Press/VIP, 2008, pp. 155-166.
General cognitive principles for learning structure in time and space, Trends in Cognitive Science 14:6, 2010, pp. 249-258 (with M. Goldstein, H. Westerfall, A. Lotem, L. Onnis, J. Schwade, S. Edelman).
Viewpoint: Journals for Certification, Conferences for Rapid Dissemination, Communications of the ACM 54:8, 2011, pp. 36-38 (with D. C. Parkes).
Co-evolution of learning and data-acquisition mechanisms: a model for cognitive evolution, Philosophical Transactions of the Royal Society (with A. Lotem).
Dexter Kozen: An appreciation, Kozen Festschrift, Lecture Notes in Computer Science, vol. 7230, Springer, 2012, pp. 324-325.
The bottleneck may be the solution, not the problem (invited commentary), Behavioral and Brain Sciences 39, 2016 (with A. Lotem, O. Kolodny, L. Onnis, and S. Edelman).
The evolution of cognitive mechanisms in response to cultural innovations, Proceedings of the National Academy of Science 114:30, 2017, pp. 7915-7922 (with A. Lotem, S. Edelman, and O. Kolodny).
In defense of liquid democracy, Proceedings of the Twenty-fourth ACM Conference on Electronic Commerce, 2023 (with D. Halpern, A. Jadbabaie, E. Mossel, A. D. Procaccia, and M. Ravel).
Chunking tasks for present-biased agents, Proceedings of the Twenty-fourth ACM Conference on Electronic Commerce, 2023 (with A. Saraf).