Related papers: Entanglement and quantum strategies reduce congest…
Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks. However, state-of-the-art solutions are frequently limited by restrictive operational assumptions, prohibitive computational…
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the $N$-coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is…
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…
A quantum financial approach to finite games of strategy is addressed, with an extension of Nash's theorem to the quantum financial setting, allowing for an entanglement of games of strategy with two-period financial allocation problems…
In this paper we extend a popular non-cooperative network creation game (NCG) to allow for disconnected equilibrium networks. There are n players, each is a vertex in a graph, and a strategy is a subset of players to build edges to. For…
We study a class of games with a continuum of players for which Cournot-Nash equilibria can be obtained by the minimisation of some cost, related to optimal transport. This cost is not convex in the usual sense in general but it turns out…
A quantum Cournot game of which classical form game has multiple Nash equilibria is examined. Although the classical equilibria fail to be Pareto optimal, the quantum equilibrium exhibits the following two properties, (i) if the measurement…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
This paper studies the distributed generalized Nash equilibrium seeking problem for aggregative games with coupling constraints, where each player optimizes its strategy depending on its local cost function and the estimated strategy…
We study manipulation of entanglement between two identical networks of quantum mechanical particles. Firstly, we reduce the problem of entanglement transfer to the problem of quantum state transfer. Then, we consider entanglement…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…
The properties of the Cournot model based on the most general entanglement operator containing quadratic expressions which is symmetric with respect to the exchange of players are considered. The degree of entanglement of games dependent on…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
One key in real-life Nash equilibrium applications is to calibrate players' cost functions. To leverage the approximation ability of neural networks, we proposed a general framework for optimizing and learning Nash equilibrium using neural…
The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the…
A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy profiles and their associated payoffs to…
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…
We consider a resource allocation problem where individual users wish to send data across a network to maximize their utility, and a cost is incurred at each link that depends on the total rate sent through the link. It is known that as…