Related papers: Game-theoretic perspective of Ping-Pong Protocol

This paper focuses on a one person game called Indian policeman's dilemma (IPD). It represents the internal conflict between emotion and profession of a typical Indian police officer. We have 'split' the game to be played independently by…

We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positional optimal strategies, whereas even basic concurrent…

We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) $g$-expectation. We then consider a non-zero-sum…

We study two-player multi-weighted reachability games played on a finite directed graph, where an agent, called P1, has several quantitative reachability objectives that he wants to optimize against an antagonistic environment, called P2.…

This paper considers the problem of designing optimal algorithms for reinforcement learning in two-player zero-sum games. We focus on self-play algorithms which learn the optimal policy by playing against itself without any direct…

Stochastic patrol routing is known to be advantageous in adversarial settings; however, the optimal choice of stochastic routing strategy is dependent on a model of the adversary. We adopt a worst-case omniscient adversary model from the…

We consider joint optimization of artificial noise (AN) and information signals in a MIMO wiretap interference network, wherein the transmission of each link may be overheard by several MIMO-capable eavesdroppers. Each information signal is…

Honeypots play a crucial role in implementing various cyber deception techniques as they possess the capability to divert attackers away from valuable assets. Careful strategic placement of honeypots in networks should consider not only…

We consider a wireless communication system in which $N$ transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a…

As large language models grow increasingly capable, concerns about their safe deployment have intensified. While numerous alignment strategies aim to restrict harmful behavior, these defenses can still be circumvented through carefully…

Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a…

We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…

The game-theoretic risk management framework put forth in the precursor work "Towards a Theory of Games with Payoffs that are Probability-Distributions" (arXiv:1506.07368 [q-fin.EC]) is herein extended by algorithmic details on how to…

We study a two-player model of conflict with multiple battlefields -- the novel element is that each of the players has their own network of spillovers so that resources allocated to one battle can be utilized in winning neighboring…

A significant aspect of the study of quantum strategies is the exploration of the game-theoretic solution concept of the Nash equilibrium in relation to the quantization of a game. Pareto optimality is a refinement on the set of Nash…

We consider the problem of a game theorist analyzing a game that uses cryptographic protocols. Ideally, a theorist abstracts protocols as ideal, implementation-independent primitives, letting conclusions in the "ideal world" carry over to…

Probabilistic model checking for stochastic games enables formal verification of systems that comprise competing or collaborating entities operating in a stochastic environment. Despite good progress in the area, existing approaches focus…

Nash equilibrium is employed to find a game theoretic robust security bound on quantum bit error rate (QBER) for DL04 protocol which is a scheme for quantum secure direct communication that has been experimentally realized recently. The…

A Dynkin game is a zero-sum, stochastic stopping game between two players where either player can stop the game at any time for an observable payoff. Typically the payoff process of the max-player is assumed to be smaller than the payoff…