不确定性下强Berge均衡的存在性

在已知不确定参数变化的范围下,研究了非合作博弈与广义非合作博弈的强Berge均衡的存在性,基于强Berge均衡与不确定性下非合作博弈的强Nash均衡的概念,给出了不确定参数下非合作博弈与广义非合作博弈的强Berge均衡的定义,并利用Fan-Glicksberg不动点定理证明其存在性,最后用算例验证其可行性.     

Population uncertainty and Poisson games

A general class of models is developed for analyzing games with population uncertainty. Within this general class, a special class of Poisson games is defined. It is shown that Poisson games are uniquely characterized by properties of independent actions and environmental equivalence. The general definition of equilibrium for games with population uncertainty is formulated, and it is shown that the equilibria of Poisson games are invariant under payoff-irrelevant type splitting. An example of a large voting game is discussed, to illustrate the advantages of using a Poisson game model for large games. Received December 1995/Revised version July 1997     

Values of games with denumerably many players

In this paper axioms for values of games with denumerably many players are introduced and, on a certain space of games, a value is defined as a limit of values of finite games. Further, some relationships between the value that the topology on the space of games of bounded variation are investigated. It is also shown and the regular weighted majority games are members of the space on which the value is defined.     

Total Reward Stochastic Games and Sensitive Average Reward Strategies

In this paper, total reward stochastic games are surveyed. Total reward games are motivated as a refinement of average reward games. The total reward is defined as the limiting average of the partial sums of the stream of payoffs. It is shown that total reward games with finite state space are strategically equivalent to a class of average reward games with an infinite countable state space. The role of stationary strategies in total reward games is investigated in detail. Further, it is outlined that, for total reward games with average reward value 0 and where additionally both players possess average reward optimal stationary strategies, it holds that the total reward value exists.     

Cores and related solution concepts for multi-choice games

A multi-choice game is a generalization of a cooperative game in which each player has several activity levels. Cooperative games form a subclass of the class of multi-choice games.This paper extends some solution concepts for cooperative games to multi-choice games. In particular, the notions of core, dominance core and Weber set are extended. Relations between cores and dominance cores and between cores and Weber sets are extensively studied. A class of flow games is introduced and relations with non-negative games with non-empty cores are investigated.     

多目标的随机结盟对策的ZS-值

本文研究的是多目标随机结盟对策的问题，是将单目标的随机结盟对策的ZS-值拓展到多目标的随机结盟对策上，同时考虑了局中人对不同目标的偏好程度，从而，给出了多目标随机结盟对策的ZS-值的定义，并讨论了该值的性质及定理。     

Book review

The concept of antagonistic games for classical discrete control problems is applied and new classes of zero-sum dynamic games on networks are formulated and studied. Polynomial-time algorithms for solving max–min paths problem on networks are proposed and their applications (which might occur within certain financial applications) for solving max–min control problems and determining optimal strategies in zero-sum cyclic games are described. In addition max–min control problems with infinite time horizons which lead to cyclic games are studied and polynomial-time algorithm for solving zero value cyclic games is proposed.     

弱1—凸对策及其解的性质

本文提出了一类特殊的ｎ人合作对策模型─—弱１—凸对策，研究了弱１—凸对策的解的性质，并证明弱１—凸对策的解满足所有常见的公理化特征．     

Discrete Colonel Blotto and General Lotto games

A class of integer-valued allocation games—“General Lotto games”—is introduced and solved. The results are then applied to analyze the classical discrete “Colonel Blotto games”; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.     

Values for Interior Operator Games

The aim of this paper is to study a new class of cooperative games called interior operator games. These games are additive games restricted by antimatroids. We consider several types of cooperative games as peer group games, big boss games, clan games and information market games and show that all of them are interior operator games. Next, we analyze the properties of these games and compute the Shapley, Banzhaf and Tijs values.     

An application of optimization theory to the study of equilibria for games: a survey

This contribution is a survey about potential games and their applications. In a potential game the information that is sufficient to determine Nash equilibria can be summarized in a single function on the strategy space: the potential function. We show that the potential function enable the application of optimization theory to the study of equilibria. Potential games and their generalizations are presented. Two special classes of games, namely team games and separable games, turn out to be potential games. Several properties satisfied by potential games are discussed and examples from concrete situations as congestion games, global emission games and facility location games are illustrated.     

Monotonic games are spanning network games

Spanning network games, which are a generalization of minimum cost spanning tree games, were introduced by Granot and Maschler (1991), who showed that these games are always monotonic. In this paper a subclass of spanning network games is introduced, namely simplex games, and it is shown that every monotonic game is a simplex game. Hence, the class of spanning network games coincides with the class of monotonic games.     

Minimarg and maximarg operators

Two operators on the set ofn-person cooperative games are introduced, the minimarg operator and the maximarg operator. These operators can be seen as dual to each other. Some nice properties of these operators are given, and classes of games for which these operators yield convex (respectively, concave) games are considered. It is shown that, if these operators are applied iteratively on a game, in the limit one will yield a convex game and the other a concave game, and these two games will be dual to each other. Furthermore, it is proved that the convex games are precisely the fixed points of the minimarg operator and that the concave games are precisely the fixed points of the maximarg operator.     

Equilibria for Pooling Situations

This paper deals with pooling situations, which can be considered as exchange economies with indivisible goods and money, and two related cooperative games which we refer to as pooling games with individual rights and pooling games without individual rights. It is shown that the classes of pooling games without individual rights and transportation games coincide and are contained in the class of pooling games with individual rights. With tools from discrete convexity theory, it is proved that competitive equilibria for pooling situations exist. As a consequence, an alternative proof of the nonemptiness of the core of pooling games is provided.     

The Level of Interpretation of Games

This paper argues that the level of detail at which the effects or experiences of a game are supposed to be interpreted is a useful classificatory criterion, and is a valuable component of a classification scheme for games according to their purpose. Research, teaching and learning games intended to be interpreted at fine levels and coarse levels of detail are discussed and compared. It is noted that coarse-level educational games may have unintentional fine-level effects, and some methods of preventing such effects are suggested. It is also noted that fine-level games require greater accuracy of game models and more realistic player behaviour than coarse-level games. The implications of this for game design are discussed.     

Bargaining sets and the core in partitioning games

Partitioning games are useful on two counts: first, in modeling situations with restricted cooperative possibilities between the agents; second, as a general framework for many unrestricted cooperative games generated by combinatorial optimization problems.We show that the family of partitioning games defined on a fixed basic collection is closed under the strategic equivalence of games, and also for taking the monotonic cover of games. Based on these properties we establish the coincidence of the Mas-Colell, the classical, the semireactive, and the reactive bargaining setswith the core for interesting balanced subclasses of partitioning games, including assignment games, tree-restricted superadditive games, and simple network games. Prepared during the author’s Bolyai János Research Fellowship. Also supported by OTKA grant T46194.     

The fuzzy core and Shapley function for dynamic fuzzy games on matroids

In this paper, the generalized forms of the fuzzy core and the Shapley function for dynamic fuzzy games on matroids are given. An equivalent form of the fuzzy core is researched. In order to better understand the fuzzy core and the Shapley function for dynamic fuzzy games on matroids, we pay more attention to study three kinds of dynamic fuzzy games on matroids, which are named as fuzzy games with multilinear extension form, with proportional value and with Choquet integral form, respectively. Meantime, the relationship between the fuzzy core and the Shapley function for dynamic fuzzy games on matroids is researched, which coincides with the crisp case.     

Linear values for interior operator games

Interior operator games were introduced by Bilbao et al. (2005) as additive games restricted by antimatroids. In that paper several interesting cooperative games were shown as examples of interior operator games. The antimatroid is a known combinatorial structure which represents, in the game theory context, a dependence system among the players. The aim of this paper is to study a family of values which are linear functions and satisfy reasonable conditions for interior operator games. Two classes of these values are considered assuming particular properties.     

Reductions of interval noncooperative games

Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered.     

Limit Consistent Solutions in Noncooperative Games

Strong and limit consistency in finite noncooperative games are studied. A solution is called strongly consistent if it is both consistent and conversely consistent (Ref. 1). We provide sufficient conditions on one-person behavior such that a strongly consistent solution is nonempty. We introduce limit consistency for normal form games and extensive form games. Roughly, this means that the solution can be approximated by strongly consistent solutions. We then show that the perfect and proper equilibrium correspondences in normal form games, as well as the weakly perfect and sequential equilibrium correspondences for extensive form games, are limit consistent.