Related papers: Discrete bidding games
Mutual imitation games among artificial birds are studied. By employing a variety of mappings and game rules, the evolution to the edge between chaos and windows is universally confirmed. Some other general features are observed, including…
Strategic interactions between competitive entities are generally considered from the perspective of complete revelation of benefits achieved from those interactions, in the form of public payoff functions and/or beliefs, in the announced…
Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…
We study the game of go from a complex network perspective. We construct a directed network using a suitable definition of tactical moves including local patterns, and study this network for different datasets of professional tournaments…
We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
We consider a version of the ultimatum game which simultaneously combines reactive and Darwinian aspects with offers in [0,1]. By reactive aspects, we consider the effects that lead the player to change their offer given the previous…
This paper develops a novel econometric framework for static discrete choice games with costly information acquisition. In traditional discrete games, players are assumed to perfectly know their own payoffs when making decisions, ignoring…
We consider a stochastic differential equation that is controlled by means of an additive finite-variation process. A singular stochastic controller, who is a minimizer, determines this finite-variation process, while a discretionary…
We consider two-player combinatorial games in which the graph of positions is random and perhaps infinite, focusing on directed Galton-Watson trees. As the offspring distribution is varied, a game can undergo a phase transition, in which…
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…
Two losing gambling games, when alternated in a periodic or random fashion, can produce a winning game. This paradox has been inspired by certain physical systems capable of rectifying fluctuations: the so-called Brownian ratchets. In this…
We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a prediction on the Hider's position. The objective is to…
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 many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…
A group of students in 7-9 grades are inventing combinatorial impartial games. The games are played on graphs, piles, and grids. We found winning positions, optimal strategies, and other interesting facts about the games.
Competitor rating systems for head-to-head games are typically used to measure playing strength from game outcomes. Ratings computed from these systems are often used to select top competitors for elite events, for pairing players of…
Autonomous systems can substantially enhance a human's efficiency and effectiveness in complex environments. Machines, however, are often unable to observe the preferences of the humans that they serve. Despite the fact that the human's and…
Moves in chess games are usually analyzed on a case-by-case basis by professional players, but thanks to the availability of large game databases, we can envision another approach of the game. Here, we indeed adopt a very different point of…
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case of Breaker playing randomly and Maker being "clever". The…