247 citations · 1.8k across the 152 of their papers we have counts for
12 papers · 1 filter
Optimal Eventual Byzantine Agreement Protocols with Omission Failures
Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden
Work on \emph{optimal} protocols for \emph{Eventual Byzantine Agreement} (EBA) -- protocols that, in a precise sense, decide as soon as possible in every run and guarantee that all…
Rational Consensus
Joseph Y. Halpern, Xavier Vilaca
We provide a game-theoretic analysis of consensus, assuming that processes are controlled by rational agents and may fail by crashing. We consider agents that \emph{care only about…
Implementing Mediators with Asynchronous Cheap Talk
Ittai Abraham, Danny Dolev, Ivan Geffner +1
A mediator can help non-cooperative agents obtain an equilibrium that may otherwise not be possible. We study the ability of players to obtain the same equilibrium without a mediat…
No justified complaints: On fair sharing of multiple resources
Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern +2
Fair allocation has been studied intensively in both economics and computer science, and fair sharing of resources has aroused renewed interest with the advent of virtualization an…
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
Consider an asynchronous system with private channels and processes, up to of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement…
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…