1 Summary We discuss strategies in non-zero sum games of perfect information on graphs. The study of non-zero sum games on graphs is motivated by the advent of computational tasks on the worldwide web and related security requirements which have thrown up many interesting areas of interaction between game theory and computer science. For example, signing contracts on the web requires interactio...

This paper is a continuation of our papers [61 and [71 and is concerned with a continuous time Markov game in which the state space is countable and the action spaces of player I and player n are compact metric spaces. In the game, the players continuously observe the state of the system and then choose actions. As a result, the reward is paid to player I from player n and the system moves to a...

Under the notable Issacs’s condition on the Hamiltonian, the existence results of a saddle point are obtained for the stochastic recursive zero-sum differential game and mixed differential game problem, that is, the agents can also decide the optimal stopping time. Themain tools are backward stochastic differential equations BSDEs and double-barrier reflected BSDEs. As the motivation and applic...

In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set of Nash equilibria (NE) of decentralized networks comprising several transmitters communicating with a single receiver that implements single user decoding. ...

Broadcast is an important application in wireless networks, e.g. for video streaming, file distribution, or event notification. Wireless nodes are battery powered, their network lifetime depends on the energy consumption. Thus, energy efficiency is an important metric when designing broadcast protocols in infrastructureless and all-wireless networks. In this paper, we apply game theory to solve...