Related papers: The NPA hierarchy does not always attain the commu…
We discuss a connection between Bell nonlocality and Bayesian games. This link offers interesting perspectives for Bayesian games, namely to allow the players to receive advice in the form of nonlocal correlations, for instance using…
Multipartite information principles are needed to understand nonlocal quantum correlations. Towards that end, we provide optimal bounds on genuine multipartite nonlocality for classes of THRESHOLD games using the LOCCG (Local Operations…
It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the…
The robustness of multiagent systems can be affected by mistakes or behavioral biases (e.g., risk-aversion, altruism, toll-sensitivity), with some agents playing the "wrong game." This can change the set of equilibria, and may in turn harm…
Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with higher probability than is allowed by…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
We consider a problem wherein jobs arrive at random times and assume random values. Upon each job arrival, the decision-maker must decide immediately whether or not to accept the job and gain the value on offer as a reward, with the…
The deterministic membership problem for timed automata asks whether the timed language recognised by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. We show that the problem is decidable when the…
We study symmetric bimatrix games that also have the common-payoff property, i.e., the two players receive the same payoff at any outcome of the game. Due to the symmetry property, these games are guaranteed to have symmetric Nash…
Non-local games are an important part of quantum information processing. Recently there has been an increased interest in generalizing non-local games beyond the basic setup by considering games with multiple parties and/or with large…
Let $1<p<\infty$. We show the boundedness of operator-valued commutators $[\pi_a,M_b]$ on the noncommutative $L_p(L_\infty(\mathbb{R})\otimes \mathcal{M})$ for any von Neumann algebra $\mathcal{M}$, where $\pi_a$ is the $d$-adic martingale…
In this paper we focus on noncooperative games with uncertain constraints coupling the agents' decisions. We consider a setting where bounded deviations of agents' decisions from the equilibrium are possible, and uncertain constraints are…
We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…
Determining a Nash equilibrium in a $2$-player non-zero sum game is known to be PPAD-hard (Chen and Deng (2006), Chen, Deng and Teng (2009)). The problem, even when restricted to win-lose bimatrix games, remains PPAD-hard (Abbott, Kane and…
An operator $T \in \mathcal{B}(X)$ defined on a Banach space $X$ satisfies property $(gb)$ if the complement in the approximate point spectrum $\sigma_{a}(T)$ of the upper semi-B-Weyl spectrum $\sigma_{SBF_{+}^{-}}(T)$ coincides with the…
In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer $B \geq 2$, there is a set of jobs to be processed by a single processor subject to the…
Many problems in compositional synthesis and verification of multi-agent systems -- such as rational verification and assume-guarantee verification in probabilistic systems -- reduce to reasoning about two-player multi-objective stochastic…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
In the theory of games on infinite-state arenas, there is a stark contrast between (i) recursion-based models such as pushdown systems and extensions on one hand, and (ii) counter-based models like vector addition systems with states (VASS)…
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…