相关论文: A duality principle for selection games
In the {\em Musical Chairs} game $MC(n,m)$ a team of $n$ players plays against an adversarial {\em scheduler}. The scheduler wins if the game proceeds indefinitely, while termination after a finite number of rounds is declared a win of the…
The principle that rational agents should maximize expected utility or choiceworthiness is intuitively plausible in many ordinary cases of decision-making under uncertainty. But it is less plausible in cases of extreme, low-probability risk…
Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one's own…
We study a complementarity game as a systematic tool for the investigation of the interplay between individual optimization and population effects and for the comparison of different strategy and learning schemes. The game randomly pairs…
The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this…
We discuss a duel-type game in which Player I uses his resource continuously and Player II distributes it by discrete portions. Each player knows how much resources he and his opponent have at every moment of time. The solution of the game…
We study an ensemble of individuals playing the two games of the so-called Parrondo paradox. In our study, players are allowed to choose the game to be played by the whole ensemble in each turn. The choice cannot conform to the preferences…
In this work, we proposed a new $N$-person game in which the players can bet on two options, for example represented by two boxers. Some of the players have privileged information about the boxers and part of them can provide this…
For a finite set $X$, a family of sets ${\mathcal F} \subseteq 2^X$ and a positive integer $q$, we consider two types of two player, perfect information games with no chance moves. In each round of the $(1 : q)$ Waiter-Client game $(X,…
In Part I of this two-part paper [1], we proposed a new game, called Chinese restaurant game, to analyze the social learning problem with negative network externality. The best responses of agents in the Chinese restaurant game with…
We consider clustering player behavior and learning the optimal team composition for multiplayer online games. The goal is to determine a set of descriptive play style groupings and learn a predictor for win/loss outcomes. The predictor…
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a…
Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a…
We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded,…
"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal…
A selfish learner seeks to maximize their own success, disregarding others. When success is measured as payoff in a game played against another learner, mutual selfishness typically fails to produce the optimal outcome for a pair of…
Combinatorial games are two-player games of pure strategy where the players, usually called Left and Right, move alternately. In this paper, we introduce Cheating Robot games. These arise from simultaneous-play combinatorial games where one…
Given a mapping from a set of players to the leaves of a complete binary tree (called a seeding), a knockout tournament is conducted as follows: every round, every two players with a common parent compete against each other, and the winner…
Consider the following game between a random player R and a deterministic player D. There is a pile of n elements at the beginning. The rules for playing are as follows: In each turn of R, if the pile contains exactly m elements, R removes…
Evolutionary game theory assumes that players replicate a highly scored player's strategy through genetic inheritance. However, when learning occurs culturally, it is often difficult to recognize someone's strategy just by observing the…