Related papers: Player preferences in $N$-player games

This thesis presents some geometric insights into three different types of two player prediction games -- namely general learning task, prediction with expert advice, and online convex optimization. These games differ in the nature of the…

In the standard setting of approachability there are two players and a target set. The players play repeatedly a known vector-valued game where the first player wants to have the average vector-valued payoff converge to the target set which…

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

In recent years, two-player zero-sum games with multiple objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, Player 1 wins if he can ensure that all objectives are…

The main objective of this work is to describe games which fall under title of Potential and simplify the conditions for class of aggregative games. Games classified as aggregative are ones in which, in addition to the player's own action,…

We introduce a two-player game in which one and his/her opponent attempt to pack as many ``prisoners'' as possible on the squares of an n-by-n checkerboard; each prisoner has to be ``protected'' by at least as many guards as the number of…

A comply/constrain game or a game with a Muller twist is a game where the next player is allowed to place constraints on opponent's next move. We develop a closed form formula for the Grundy value of the single-pile subtraction game where…

In repeated interactions between individuals, we do not expect that exactly the same situation will occur from one time to another. Contrary to what is common in models of repeated games in the literature, most real situations may differ a…

A traditional assumption in game theory is that players are opaque to one another---if a player changes strategies, then this change in strategies does not affect the choice of other players' strategies. In many situations this is an…

We study a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes. The agents are only told whether the…

We study the asymptotic organization among many optimizing individuals interacting in a suitable "moderate" way. We justify this limiting game by proving that its solution provides approximate Nash equilibria for large but finite player…

In this work, after given the definition of soft sets and their basic operations we define two person soft games which can apply to problems contain vagueness and uncertainty. We then give four solution methods of the games which are soft…

Two new versions of the so-called Maker-Breaker Positional Games are defined by J\'ozsef Beck in [{\em Combinatorica} {\bf 22}(2) (2002) 169--216]. He defines two players, Picker and Chooser. In each round, Picker takes a pair of elements…

In this paper we consider positional games where the winning sets are tree universal graphs. Specifically, we show that in the unbiased Maker-Breaker game on the complete graph $K_n$, Maker has a strategy to occupy a graph which contains…

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…

In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells…

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the…

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…