80,300 research outputs found
Inadequacy of Modal Logic in Quantum Settings
We test the principles of classical modal logic in fully quantum settings.
Modal logic models our reasoning in multi-agent problems, and allows us to
solve puzzles like the muddy children paradox. The Frauchiger-Renner thought
experiment highlighted fundamental problems in applying classical reasoning
when quantum agents are involved; we take it as a guiding example to test the
axioms of classical modal logic. In doing so, we find a problem in the original
formulation of the Frauchiger-Renner theorem: a missing assumption about
unitarity of evolution is necessary to derive a contradiction and prove the
theorem. Adding this assumption clarifies how different interpretations of
quantum theory fit in, i.e., which properties they violate. Finally, we show
how most of the axioms of classical modal logic break down in quantum settings,
and attempt to generalize them. Namely, we introduce constructions of trust and
context, which highlight the importance of an exact structure of trust
relations between agents. We propose a challenge to the community: to find
conditions for the validity of trust relations, strong enough to exorcise the
paradox and weak enough to still recover classical logic.Comment: In Proceedings QPL 2018, arXiv:1901.0947
Monte Carlo Planning method estimates planning horizons during interactive social exchange
Reciprocating interactions represent a central feature of all human exchanges. They have been the target of various recent experiments, with healthy participants and psychiatric populations engaging as dyads in multi-round exchanges such as a repeated trust task. Behaviour in such exchanges involves complexities related to each agent's preference for equity with their partner, beliefs about the partner's appetite for equity, beliefs about the partner's model of their partner, and so on. Agents may also plan different numbers of steps into the future. Providing a computationally precise account of the behaviour is an essential step towards understanding what underlies choices. A natural framework for this is that of an interactive partially observable Markov decision process (IPOMDP). However, the various complexities make IPOMDPs inordinately computationally challenging. Here, we show how to approximate the solution for the multi-round trust task using a variant of the Monte-Carlo tree search algorithm. We demonstrate that the algorithm is efficient and effective, and therefore can be used to invert observations of behavioural choices. We use generated behaviour to elucidate the richness and sophistication of interactive inference
Dispute Resolution Using Argumentation-Based Mediation
Mediation is a process, in which both parties agree to resolve their dispute
by negotiating over alternative solutions presented by a mediator. In order to
construct such solutions, mediation brings more information and knowledge, and,
if possible, resources to the negotiation table. The contribution of this paper
is the automated mediation machinery which does that. It presents an
argumentation-based mediation approach that extends the logic-based approach to
argumentation-based negotiation involving BDI agents. The paper describes the
mediation algorithm. For comparison it illustrates the method with a case study
used in an earlier work. It demonstrates how the computational mediator can
deal with realistic situations in which the negotiating agents would otherwise
fail due to lack of knowledge and/or resources.Comment: 6 page
Monte Carlo Planning method estimates planning horizons during interactive social exchange
Reciprocating interactions represent a central feature of all human
exchanges. They have been the target of various recent experiments, with
healthy participants and psychiatric populations engaging as dyads in
multi-round exchanges such as a repeated trust task. Behaviour in such
exchanges involves complexities related to each agent's preference for equity
with their partner, beliefs about the partner's appetite for equity, beliefs
about the partner's model of their partner, and so on. Agents may also plan
different numbers of steps into the future. Providing a computationally precise
account of the behaviour is an essential step towards understanding what
underlies choices. A natural framework for this is that of an interactive
partially observable Markov decision process (IPOMDP). However, the various
complexities make IPOMDPs inordinately computationally challenging. Here, we
show how to approximate the solution for the multi-round trust task using a
variant of the Monte-Carlo tree search algorithm. We demonstrate that the
algorithm is efficient and effective, and therefore can be used to invert
observations of behavioural choices. We use generated behaviour to elucidate
the richness and sophistication of interactive inference
- …