Related papers: Computing Branching Distances Using Quantitative G…

This paper motivates the use of random-bridges -- stochastic processes conditioned to take target distributions at fixed timepoints -- in the realm of generative modelling. Herein, random-bridges can act as stochastic transports between two…

Here we study multiplayer linear games, a natural generalization of XOR games to multiple outcomes. We generalize a recently proposed efficiently computable bound, in terms of the norm of a game matrix, on the quantum value of 2-player…

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…

This work tackles the problem of energy-efficient distributed power control in wireless networks with a large number of transmitters. The problem is modeled by a dynamic game. Each transmitter-receiver communication is characterized by a…

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…

Stochastic optimal control and games have a wide range of applications, from finance and economics to social sciences, robotics, and energy management. Many real-world applications involve complex models that have driven the development of…

A continuous time mixed state branching process is constructed as the scaling limits of two-type Galton-Watson processes. The process can also be obtained by the pathwise unique solution to a stochastic equation system. From the stochastic…

We compare two different ways of quantization a simple sequential game Cat's Dilemma in the context of the debate on intransitive and transitive preferences. This kind of analysis can have essential meaning for the research on the…

Game theory is playing more and more important roles in understanding complex systems and in investigating intelligent machines with various uncertainties. As a starting point, we consider the classical two-player zero-sum linear-quadratic…

Diffusion processes with branching play an important role in statistical dynamics. They are a common approach to the computing of quantum mechanical groundstates, and serve as models for population dynamics and as physical pictures for…

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

We develop a method for the transfer of perfect strategies between various classes of two-player, one round cooperative non-local games with quantum inputs and outputs using the simulation paradigm in quantum information theory. We show…

Computational models are quantitative representations of systems. By analyzing and comparing the outputs of such models, it is possible to gain a better understanding of the system itself. Though as the complexity of model outputs…

This paper presents a game theoretic solution for end-to-end channel and power allocation in multihop cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes…

We develop a general approach to setting up and studying classes of quantum dynamical systems close to and structurally similar to systems having specified properties, in particular detailed balance. This is done in terms of transport plans…

Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…

For prediction of interacting agents' trajectories, we propose an end-to-end trainable architecture that hybridizes neural nets with game-theoretic reasoning, has interpretable intermediate representations, and transfers to downstream…

We introduce a formal notion of masking fault-tolerance between probabilistic transition systems using stochastic games. These games are inspired in bisimulation games, but they also take into account the possible faulty behavior of…