Related papers: Selection Games on Continuous Functions
In the paper we present a model of discrete-time mean-field game with several populations of players. Mean-field games with multiple populations of the players have only been studied in the literature in the continuous-time setting. The…
We study large fluctuations in evolutionary games belonging to the coordination and anti-coordination classes. The dynamics of these games, modeling cooperation dilemmas, is characterized by a coexistence fixed point separating two…
This paper deals with a standard stochastic game model with a continuum of states under the duel-type setup. It newly proposes a hybrid model of game theory and the fluctuation process, which could be applied for various practical decision…
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…
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…
Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…
Once failure is irreversible, continuation payoffs cannot be meaningfully aggregated across strategies that differ in their survival properties. Standard scalar evaluation sidesteps this by arbitrarily completing payoffs beyond termination,…
We address the problem of how cooperative (altruistic-like) behavior arises in natural and social systems by analyzing an ultimatum game in complex networks. Specifically, three types of players are considered: (a) empathetic, whose…
We provide theorems containnig both Kakutani and Browder fixed points theorems as immediate corollaries, as well as Michael and Browder selection theorems. For this purpose we introduce convex structures more general than those of locally…
We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…
We consider discrete-time uncertain processes with finite state space and study the properties of game-theoretic upper expectations developed by Shafer and Vovk. We start by proving some basic properties, e.g. monotonicity, law of iterated…
We conducted a laboratory experiment involving human subjects to test the theoretical hypothesis that equilibrium selection can be impacted by manipulating the games dynamics process, by using modern control theory. Our findings indicate…
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a…
Cooperation through repetition is an important theme in game theory. In this regard, various celebrated ``folk theorems'' have been proposed for repeated games in increasingly more complex environments. There has, however, been insufficient…
Closed drafting or "pick and pass" is a popular game mechanic where each round players select a card or other playable element from their hand and pass the rest to the next player. In this paper, we establish first-principle methods for…
In this paper, we establish a large deviations principle (LDP) for interacting particle systems that arise from state and action dynamics of discrete-time mean-field games under the equilibrium policy of the infinite-population limit. The…
We give new characterizations of core imputations for the following games: * The assignment game. * Concurrent games, i.e., general graph matching games having non-empty core. * The unconstrained bipartite $b$-matching game (edges can be…
We construct a model of strategic imitation in an arbitrary network of players who interact through an additive game. Assuming a discrete time update, we show a condition under which the resulting difference equations converge to consensus.…
Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games. In this paper I…