A Nash equilibrium x of a normal-form game G is essential if any perturbation of G has an equilibrium close to x. Using payoff perturbations, we show that for games that are generic in the set of compact, quasiconcave, and generalized payoff secure games with upper semicontinuous sum of payoffs, all equilibria are essential. Some variants of this result are also established. © 2009 Elsevier Inc...

The past decades have witnessed a growing interest in research on deductive games such as Mastermind and AB game. Because of the complicated behavior of deductive games, tree-search approaches are often adopted to find their optimal strategies. In this paper, a generalized version of deductive games, called 3 × n AB games, is introduced. However, tranditional tree-search approaches are not appr...

Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives...

We study a generalized form of planning under partial observability, in which we have multiple, possibly infinitely many, planning domains with the same actions and observations, and goals expressed over observations, which are possibly temporally extended. By building on work on two-player (nonprobabilistic) games with imperfect information in the Formal Methods literature, we devise a general...

A generalized model of games is proposed, with which both cooperative games and non-cooperative games can be expressed and analyzed, as well as those games that are neither cooperative nor non-cooperative. The model is based on relationships between players and supposed relationships. A relationship is a numerical value that denotes how one player cares for the payoffs of another player. A supp...

This paper deals with bimatrix games in uncertainty environment based on several types of ordering, which Maeda proposed. But Maeda’s models was just made based on symmetrical triangle fuzzy variable. In this paper, we generalized Maeda’s model to the non-symmetrical environment. In other words, we investigated the fuzzy bimatrix games based on nonsymmetrical L-R fuzzy variables. Then the pseud...

This paper treats reciprocal externalities as a special case of how people interact. Two-person two-choice games are used to construct a theory and taxonomy of interactions and to show that separability of objective functions (utility, cost, or profit) is sufficient, but not necessary, for the existence of dominant strategies. The model is generalized to Nx2 games and applied to tax evasion, ru...

Different types of dynamics have been studied in repeated game play, and one of them which has received much attention recently consists of those based on “no-regret” algorithms from the area of machine learning. It is known that dynamics based on generic no-regret algorithms may not converge to Nash equilibria in general, but to a larger set of outcomes, namely coarse correlated equilibria. Mo...

This paper is mainly to discuss cooperative games on convex geometries with a coalition structure, which can be seen as an extension of cooperative games with a coalition structure. For this kind of games, the cooperation among unions and within each union will be the convex sets, i.e., the feasible subsets of the coalition structure and that of each union belong to a convex geometry, respectiv...

Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of the interval game with no additional uncertainty. We introduce new selection-based classes of interval games and prove their characterization theorems and rela...