Related papers: Variations on Keeler's Theorem
In this paper, we discuss different models for human logic systems and describe a game with nature. Godel`s incompleteness theorem is taken into account to construct a model of logical networks based on axioms obtained by symmetry breaking.…
Machines driven by large language models (LLMs) have the potential to augment humans across various tasks, a development with profound implications for business settings where effective communication, collaboration, and stakeholder trust…
We formulate and prove a de Finetti representation theorem for finitely exchangeable states of a quantum system consisting of k infinite-dimensional subsystems. The theorem is valid for states that can be written as the partial trace of a…
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. (2) We discovered that quantum…
We discuss Wiseman, Cavalcanti and Rieffel's "thoughtful" local friendliness no-go theorem and the experimental programme they propose to test local friendliness inequalities. We argue that, to prove the theorem, the assumptions need to be…
The ``N-Box Experiment'' is a much-discussed thought experiment in quantum mechanics. It is claimed by some authors that a single particle prepared in a superposition of N+1 box locations and which is subject to a final ``post-selection''…
The brain is very often viewed as a network, be it at small scale made of cells, mostly neurons, or at larger scale made of neuronal assemblies. Here we introduce a conjecture, in the spirit of a philosophical though experiment, which…
The finite entropy of de Sitter space suggests that in a theory of quantum gravity there are only finitely many states. It has been argued that in this case there is no action of the de Sitter group consistent with unitarity. In this note…
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…
There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein, charges an agent for doing costly computation; the second, initiated by Neyman, does not charge for…
We derive a simple analytical expression for the two-body force in a sub-class of MOND-like theories and make testable predictions in the modification to the two-body orbital period, shape, and precession rate, and escape speed etc. We…
We introduce a novel online multitask setting. In this setting each task is partitioned into a sequence of segments that is unknown to the learner. Associated with each segment is a hypothesis from some hypothesis class. We give algorithms…
Recent experimental evidence [Gruji\'c et al., PLoS ONE 5, e13749 (2010)] on the spatial Prisoner's Dilemma suggests that players choosing to cooperate or not on the basis of their previous action and the actions of their neighbors coexist…
We investigate quantum strategy in moving frames by considering Prisoner's Dilemma and propose four thresholds of $\gamma$ for two players to determine their \textit{Nash Equilibria}. Specially, an interesting phenomenon appears in…
We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multi-prover quantum interactive proof…
Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…
We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner's Dilemma, where the quantum circuit is realized by a 4-qubit…
The quantum mechanical approach to the well known prisoners dilemma, one of the basic examples to illustrate the concepts of Game Theory, is implemented with a classical optical resource, nonquantum entanglement between spin and orbital…
Punishment is a common tactic to sustain cooperation and has been extensively studied for a long time. While most of previous game-theoretic work adopt the imitation learning where players imitate the strategies who are better off, the…
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…