Related papers: Asymmetric cut and choose games
We study a portioning setting in which a public resource such as time or money is to be divided among a given set of candidates, and each agent proposes a division of the resource. We consider two families of aggregation rules for this…
An abstraction of normal form games is proposed, called Feasibility/Desirability Games (or FD Games in short). FD Games can be seen from three points of view: as a new presentation of games in which Nash equilibria can be found, as choice…
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically…
We study generalized games defined over Banach spaces using variational analysis. To reformulate generalized games as quasi-variational inequality problems, we will first form a suitable principal operator and study some significant…
Many real-world problems modeled by stochastic games have huge state and/or action spaces, leading to the well-known curse of dimensionality. The complexity of the analysis of large-scale systems is dramatically reduced by exploiting mean…
We propose the study of mathematical ludology, which aims to formally interrogate questions of interest to game studies and game design in particular. The goal is to extend our mathematical understanding of complex games beyond…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…
Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the risk that the solutions we compute are not robust to errors in this specification. Ordinal games provide an attractive alternative: they require…
Game theory has by now found numerous applications in various fields, including economics, industry, jurisprudence, and artificial intelligence, where each player only cares about its own interest in a noncooperative or cooperative manner,…
We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…
In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed…
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…
A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy profiles and their associated payoffs to…
This article deals with certain star variants of the Scheepers property. We introduce and study the star-$K$-Scheepers property and corresponding game. The relationships between the game corresponding to the star-$K$-Scheepers property and…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We analyze cooperative Cournot games with boundedly rational firms. Due to cogni- tive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value using…
Aim: Present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of…
We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and an- other with a payoff dependent on others' selected actions. This…
Game theory is the study of tractable games which may be used to model more complex systems. Board games, video games and sports, however, are intractable by design, so "ludological" theories about these games as complex phenomena should be…