Related papers: Quantal Response Equilibria in Binary Choice Games…

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…

We study the scenario where the players of a classical complete information game initially share an entangled pure quantum state. Each player may perform arbitrary local operations on his own qubits, but no direct communication is allowed.…

A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…

We discuss the non-equilibrium dynamics of a Quantum Ising Chain (QIC) following a quantum quench of the transverse field and in the presence of a gaussian time dependent noise. We discuss the probability distribution of the work done on…

This paper presents a novel data-driven approach for approximating the $\varepsilon$-Nash equilibrium in continuous-time linear quadratic Gaussian (LQG) games, where multiple agents interact with each other through their dynamics and…

This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…

We study quantum advantage in one-step rendezvous games on simple graphs analytically, numerically, and using noisy intermediate-scale quantum (NISQ) processors. Our protocols realise the recently discovered [arXiv:2207.14404] optimal…

This contribution reviews the parallel dynamics of Q-Ising neural networks for various architectures: extremely diluted asymmetric, layered feedforward, extremely diluted symmetric, and fully connected. Using a probabilistic signal-to-noise…

We solved the Quantum Kinetic Equations (QKEs) for an active-sterile neutrino system in the early universe. While on the surface this may seem to be an overly simplistic system, other linear two-state systems can be mapped onto the…

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model…

In game theory, an Evolutionarily Stable Set (ES set) is a set of Nash Equilibrium (NE) strategies that give the same payoffs. Similar to an Evolutionarily Stable Strategy (ES strategy), an ES set is also a strict NE. This work investigates…

In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…

We discuss the connection between a class of distributed quantum games, with remotely located players, to the counter intuitive Braess' paradox of traffic flow that is an important design consideration in generic networks where the addition…

Motivated by applications in job scheduling, queuing networks, and load balancing in cyber-physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these…

We study a dynamic game with a large population of players who choose actions from a finite set in continuous time. Each player has a state in a finite state space that evolves stochastically with their actions. A player's reward depends…

We analyze quantum game with correlated noise through generalized quantization scheme. Four different combinations on the basis of entanglement of initial quantum state and the measurement basis are analyzed. It is shown that the advantage…

Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…

The multi-population replicator dynamics (RD) can be considered a dynamic approach to the study of multi-player games, where it was shown to be related to Cross' learning, as well as of systems of coevolving populations. However, not all of…

For dynamic situations where the evolution of a player's state is influenced by his own action as well as other players' states and actions, we show that equilibria derived for nonatomic games (NGs) can be used by their large finite…

Contemporary technological challenges often involve many degrees of freedom in a distributed or networked setting. Three aspects are notable: the variables are usually associated with the nodes of a graph with limited communication…