Related papers: The Chaos Game on a General Iterated Function Syst…
We devise a policy-iteration algorithm for deterministic two-player discounted and mean-payoff games, that runs in polynomial time with high probability, on any input where each payoff is chosen independently from a sufficiently random…
In this paper, we show that two-dimensional billiards with point interactions inside exhibit a chaotic nature in the microscopic world, although their classical counterpart is non-chaotic. After deriving the transition matrix of the system…
We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.
Commitments play a crucial role in game theory, shaping strategic interactions by either altering a player's own payoffs or influencing the incentives of others through outcome-contingent payments. While most research has focused on using…
Game theory provides a quantitative framework for analyzing the behavior of rational agents. The Iterated Prisoner's Dilemma in particular has become a standard model for studying cooperation and cheating, with cooperation often emerging as…
A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…
The deep learning revolution has spurred a rise in advances of using AI in sciences. Within physical sciences the main focus has been on discovery of dynamical systems from observational data. Yet the reliability of learned surrogates and…
The article introduces a notion of a stochastic game with failure states and proposes two logical systems with modality "coalition has a strategy to transition to a non-failure state with a given probability while achieving a given goal."…
We consider a number of questions related to tradeoffs between reward and regret in repeated gameplay between two agents. To facilitate this, we introduce a notion of $\textit{generalized equilibrium}$ which allows for asymmetric regret…
In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…
Evolutionary game theory offers a general framework to study how behaviors evolve by social learning in a population. This body of theory can accommodate a range of social dilemmas, or games, as well as real-world complexities such as…
Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access…
Imitation is simple behavior which uses successful actions of others in order to deal with one's own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or…
This note provides a general construction, and gives a concrete example of, forced ordinary differential equation systems that have these two properties: (a) for each constant input u, all solutions converge to a steady state but (b) for…
Chaos is an inherently dynamical phenomenon traditionally studied for trajectories that are either permanently erratic or transiently influenced by permanently erratic ones lying on a set of measure zero. The latter gives rise to the final…
In this note, we prove the existence of an equilibrium concept, dubbed conditional strategy equilibrium, for non-cooperative games in which a strategy of a player is a function from the other players' actions to her own actions. We study…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
Compared to ordinary function minimization problems, min-max optimization algorithms encounter far greater challenges because of the existence of periodic cycles and similar phenomena. Even though some of these behaviors can be overcome in…
In this paper, we study a distributed continuous-time design for aggregative games with coupled constraints in order to seek the generalized Nash equilibrium by a group of agents via simple local information exchange. To solve the problem,…
In this paper, we demonstrate, first in literature known to us, that potential functions can be constructed in continuous dissipative chaotic systems and can be used to reveal their dynamical properties. To attain this aim, a Lorenz-like…