相关论文: Real World Games Look Like Spinning Tops

We consider the lifetimes of metastable states in bistable evolutionary games (coordination games), and examine how they are affected by spatial structure. A semiclassical approximation based on a path integral method is applied to…

Consider a $n \times n$ tic-tac-toe board. In each field of the board, draw a smaller $n\times n$ tic-tac-toe board. Now let super tic-tac-toe (STTT) be a game where each player's move dictates which field on the larger board a player must…

Generating payoff matrices of normal-form games at random, we calculate the frequency of games with a unique pure strategy Nash equilibrium in the ensemble of $n$-player, $m$-strategy games. These are perfectly predictable as they must…

Evolutionary game theory has been an important tool for describing economic and social behaviour for decades. Approximate mean value equations describing the time evolution of strategy concentrations can be derived from the players'…

The predominant paradigm in evolutionary game theory and more generally online learning in games is based on a clear distinction between a population of dynamic agents that interact given a fixed, static game. In this paper, we move away…

Monte Carlo simulations and dynamical mean-field approximations are performed to study the phase transitions in rock-scissors-paper game on different host networks. These graphs are originated from lattices by introducing quenched and…

We establish a network formation game for the Internet's Autonomous System (AS) interconnection topology. The game includes different types of players, accounting for the heterogeneity of ASs in the Internet. We incorporate reliability…

We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…

This paper describes a new algorithm for decision making in two-player real-time video games. As with Monte Carlo Tree Search, the algorithm can be used without heuristics and has been developed for use in general video game AI. The…

There is a common belief that humans and many animals follow transitive inference (choosing A over C on the basis of knowing that A is better than B and B is better than C). Transitivity seems to be the essence of rational choice. We…

Games and simulators can be a valuable platform to execute complex multi-agent, multiplayer, imperfect information scenarios with significant parallels to military applications: multiple participants manage resources and make decisions that…

The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the…

We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…

Elucidating the mechanisms that lead to cooperation is still one of the main scientific challenges of current times, as many common cooperative scenarios remain elusive and at odds with Darwin's natural selection theory. Here, we study…

Routing games are amongst the most studied classes of games. Their two most well-known properties are that learning dynamics converge to equilibria and that all equilibria are approximately optimal. In this work, we perform a stress test…

Equilibrium solution concepts of normal-form games, such as Nash equilibria, correlated equilibria, and coarse correlated equilibria, describe the joint strategy profiles from which no player has incentive to unilaterally deviate. They are…

We study a game where two players take turns selecting points of a convex geometry until the convex closure of the jointly selected points contains all the points of a given winning set. The winner of the game is the last player able to…

In evolutionary game theory, it is customary to be partial to the dynamical models possessing fixed points so that they may be understood as the attainment of evolutionary stability, and hence, Nash equilibrium. Any show of periodic or…

In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…

Evolutionary game theory studies populations that change in response to an underlying game. Often, the functional form relating outcome to player attributes or strategy is complex, preventing mathematical progress. In this work, we…