A Classification of Weakly Acyclic Games
نویسندگان
چکیده
Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). In such games one stipulates that from any initial joint strategy some finite improvement path exists. We classify weakly acyclic games using the concept of a scheduler introduced in [15]. We also show that finite games that can be solved by the iterated elimination of never best response strategies are weakly acyclic. Finally, we explain how the schedulers allow us to improve the bounds on finding a Nash equilibrium in a weakly acyclic game.
منابع مشابه
Classification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions
Acyclic phase-type distributions form a versatile model, serving as approximations to many probability distributions in various circumstances. They exhibit special properties and characteristics that usually make their applications attractive. Compared to acyclic continuous phase-type (ACPH) distributions, acyclic discrete phase-type (ADPH) distributions and their subclasses (ADPH family) have ...
متن کاملLearning by Adaptive and Forward-Looking Players with One Period Memory
We investigate how much simple-minded players with one period memory can learn for general stage games. The adaptive and one-step forward-looking behavior rules are sufficient for convergence to a minimal weak curb set. Weak curb sets are in general larger than the curb sets but the minimal ones coincide for many games including weakly acyclic games and supermodular games. We also provide an ex...
متن کاملOn terminating improvement in two-player games
A real-valued game has the finite improvement property (FIP), if starting from an arbitrary strategy profile and letting the players change strategies to increase their individual payoffs in a sequential but non-deterministic order always reaches a Nash equilibrium. E.g., potential games have the FIP. Many of them have the FIP by chance, though, since modifying even a single payoff may ruin the...
متن کاملDecentralized Q-Learning for Stochastic Dynamic Games
Abstract. There are only a few learning algorithms applicable to stochastic dynamic games. Learning in games is generally difficult because of the non-stationary environment in which each decision maker aims to learn its optimal decisions with minimal information in the presence of the other decision makers who are also learning. In the case of dynamic games, learning is more challenging becaus...
متن کاملOn Weakly Ordered Systems
The statement "x>y" may be read "x dominates y." Transitivity is not assumed ; a transitive weakly ordered system is a partially ordered system. By a solution of a weakly ordered system is meant a set V of elements of D such that (a) XÇLV and y £ V implies x># for some yÇ~ V. The concept of solution was introduced in J. von Neumann and O. Morgenstern, Theory...
متن کامل