Related papers: Generalising Aumann's Agreement Theorem
The dominant theories of rational choice assume logical omniscience. That is, they assume that when facing a decision problem, an agent can perform all relevant computations and determine the truth value of all relevant logical/mathematical…
Predictions of quantum theory have been confirmed experimentally in the microscopic domain with no known exceptions. This success motivates physicists to assume universal validity of the theory. To put the predictions of the quantum theory…
The purpose of the paper is to introduce a new approach of planning called Assumption-Based Planning. This approach is a very interesting way to devise a planner based on a multi-agent system in which the production of a global shared plan…
To reach consensus among interacting agents is a problem of interest for social, economical, and political systems. A computational and mathematical framework to investigate consensus dynamics on complex networks is naming games. In…
In this paper, we present a probabilistic adaptation of an Assume/Guarantee contract formalism. For the sake of generality, we assume that the extended state machines used in the contracts and implementations define sets of runs on a given…
Is there an equilibrium for distributed consensus when all agents except one collude to steer the decision value towards their preference? If an equilibrium exists, then an $n-1$ size coalition cannot do better by deviating from the…
Multi-agent consensus problems can often be seen as a sequence of autonomous and independent local choices between a finite set of decision options, with each local choice undertaken simultaneously, and with a shared goal of achieving a…
The paradox of Wigner's friend challenges the objectivity of description in quantum theory. A pragmatist interpretation can meet this challenge by judicious appeal to decoherence. On this interpretation, quantum theory provides situated…
What does it mean for multiple agents' credence functions to be consistent with each other, if the agents have distinct but overlapping sets of evidence? Mathematical philosopher Michael Titelbaum's rule, called Generalized…
Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…
This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). In APAL we…
We explore the possibilities of enforcing and preventing consensus in continuous opinion dynamics that result from modifications in the communication rules. We refer to the model of Weisbuch and Deffuant, where $n$ agents adjust their…
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…
A researcher observes a finite sequence of choices made by multiple agents in a binary-state environment. Agents maximize expected utilities that depend on their chosen alternative and the unknown underlying state. Agents learn about the…
I defend an analog of probabilism that characterizes rationally coherent estimates for chances. Specifically, I demonstrate the following accuracy-dominance result for stochastic theories in the C*-algebraic framework: supposing an…
How can probabilities make sense in a deterministic many-worlds theory? We address two facets of this problem: why should rational agents assign subjective probabilities to branching events, and why should branching events happen with…
We establish bounds on the probability that two different agents, who share an initial opinion expressed as a probability distribution on an abstract probability space, given two different sources of information, may come to radically…
We analyse an argument of Deutsch, which purports to show that the deterministic part of classical quantum theory together with deterministic axioms of classical decision theory, together imply that a rational decision maker behaves as if…
Consensus protocols play an important role in the study of distributed algorithms. In this paper, we study the effect of bias on two popular consensus protocols, namely, the {\em voter rule} and the {\em 2-choices rule} with binary…
Quantum theory is indeterministic, but not completely so. When a system is in a pure state there are properties it possesses with certainty, known as actual properties. The actual properties of a quantum system (in a pure state) fully…