Related papers: Games for the two membranes problem

We describe and develop a close relationship between two problems that have customarily been regarded as distinct: that of maximizing entropy, and that of minimizing worst-case expected loss. Using a formulation grounded in the equilibrium…

Optimization under uncertainty is a fundamental problem in learning and decision-making, particularly in multi-agent systems. Previously, Feldman, Kalai, and Tennenholtz [2010] demonstrated the ability to efficiently compete in repeated…

We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework users share the network resources according to Nash…

We consider two person zero-sum games where the players control, at discrete times {tn} induced by a partition $\Pi$ of R + , a continuous time Markov state process. We prove that the limit of the values v$\Pi$ exist as the mesh of $\Pi$…

We present and analyze an approximation scheme for the two-dimensional game $p$-Laplacian in the framework of viscosity solutions. The approximation is based on a semi-Lagrangian scheme which exploits the idea of $p$-averages. We study the…

For a zero-sum stochastic game which does not satisfy the Isaacs condition, we provide a value function representation for an Isaacs-type equation whose Hamiltonian lies in between the lower and upper Hamiltonians, as a convex combination…

This paper analyzes a simple game with $n$ players. We fix a mean, $\mu$, in the interval $[0, 1]$ and let each player choose any random variable distributed on that interval with the given mean. The winner of the zero-sum game is the…

In this paper, we are concerned with game-theoretic interpretations to the following oblique derivative boundary value problem \begin{align*} \left\{ \begin{array}{ll} \Delta_{p}^{N}u=0 & \textrm{in $ \Omega$,}\\ \langle \beta , Du \rangle…

We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it.…

This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…

We study optimal behavior of energy producers under a CO_2 emission abatement program. We focus on a two-player discrete-time model where each producer is sequentially optimizing her emission and production schedules. The game-theoretic…

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

We consider a two-player zero-sum deterministic differential game where each player uses both continuous and impulse controls in infinite-time horizon. We assume that the impulses supposed to be of general term and the costs depend on the…

In two-player zero-sum stochastic games, where two competing players make decisions under uncertainty, a pair of optimal strategies is traditionally described by Nash equilibrium and computed under the assumption that the players have…

An interesting iterative procedure is proposed to solve a two-player zero-sum Markov games. Under suitable assumption, the boundedness of the proposed iterates is obtained theoretically. Using results from stochastic approximation, the…

Changes in payoffs can transform Prisoner's Dilemma and other social dilemmas into harmonious win-win games. Using the Robinson-Goforth topology of 2x2 games, this paper analyzes how payoff swaps turn Prisoner's Dilemma into other games,…

We study a program game version of the Prisoner's Dilemma, i.e., a two-player game in which each player submits a computer program, the programs are given read access to each other's source code and then choose whether to cooperate or…

We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…

We prove that for a class of zero-sum differential games with incomplete information on both sides, the value admits a probabilistic representation as the value of a zero-sum stochastic differential game with complete information, where…

We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs -- in…