Cooperative games under interval uncertainty: on the convexity of the interval undominated cores

Uncertainty is a daily presence in the real world. It affects our decision making and may have influence on cooperation. Often uncertainty is so severe that we can only predict some upper and lower bounds for the outcome of our actions, i.e., payoffs lie in some intervals. A suitable game theoretic model to support decision making in collaborative situations with interval data is that of cooperative interval games. Solution concepts that associate with each cooperative interval game sets of interval allocations with appealing properties provide a natural way to capture the uncertainty of coalition values into the players’ payoffs. This paper extends interval-type core solutions for cooperative interval games by discussing the set of undominated core solutions which consists of the interval nondominated core, the square interval dominance core, and the interval dominance core. The interval nondominated core is introduced and it is shown that it coincides with the interval core. A straightforward consequence of this result is the convexity of the interval nondominated core of any cooperative interval game. A necessary and sufficient condition for the convexity of the square interval dominance core of a cooperative interval game is also provided.     

不确定条件下n人非合作博弈均衡点集的通有稳定性

基于经典博弈模型的Nash均衡点集的通有稳定性和具有不确定参数的n人非合作博弈均衡点的概念,探讨了具有不确定参数博弈的均衡点集的通有稳定性.参照Nash均衡点集稳定性的统一模式,构造了不确定博弈的问题空间和解空间,并证明了问题空间是一个完备度量空间,解映射是上半连续的,且解集是紧集（即usco（upper semicontinuous and compact-valued）映射）,得到不确定参数博弈模型的解集通有稳定性的相关结论.     

Cooperative facility location games

The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cost for opening a facility and also for connecting a customer to a facility, the goal being to minimize the total cost. Often, both in the case of public facilities (such as libraries, municipal swimming pools, fire stations, … ) and private facilities (such as distribution centers, switching stations, … ), we may want to find a ‘fair’ allocation of the total cost to the customers—this is known as the cost allocation problem. A central question in cooperative game theory is whether the total cost can be allocated to the customers such that no coalition of customers has any incentive to build their own facility or to ask a competitor to service them. We establish strong connections between fair cost allocations and linear programming relaxations for several variants of the facility location problem. In particular, we show that a fair cost allocation exists if and only if there is no integrality gap for a corresponding linear programming relaxation; this was only known for the simplest unconstrained variant of the facility location problem. Moreover, we introduce a subtle variant of randomized rounding and derive new proofs for the existence of fair cost allocations for several classes of instances. We also show that it is in general NP-complete to decide whether a fair cost allocation exists and whether a given allocation is fair.     

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     

Cooperative games with stochastic payoffs

This paper introduces a new class of cooperative games arising from cooperative decision making problems in a stochastic environment. Various examples of decision making problems that fall within this new class of games are provided. For a class of games with stochastic payoffs where the preferences are of a specific type, a balancedness concept is introduced. A variant of Farkas' lemma is used to prove that the core of a game within this class is non-empty if and only if the game is balanced. Further, other types of preferences are discussed. In particular, the effects the preferences have on the core of these games are considered.     

Cooperative games with imcomplete information

A bargaining solution concept which generalizes the Nash bargaining solution and the Shapley NTU value is defined for cooperative games with incomplete information. These bargaining solutions are efficient and equitable when interpersonal comparisons are made in terms of certainvirtual utility scales. A player's virtual utility differs from his real utility by exaggerating the difference from the preferences of false types that jeopardize his true type. In any incentive-efficient mechanism, the players always maximize their total virtual utility ex post. Conditionally-transferable virtual utility is the strongest possible transferability assumption for games with incomplete information.     

Cooperative games with large cores

A payoff vector in ann-person cooperative game is said to be acceptable if no coalition can improve upon it. The core of a game consists of all acceptable vectors which are feasible for the grand coalition. The core is said to be large if for every acceptable vectory there is a vectorx in the core withx?y. This paper examines the class of games with large cores.     

Cooperative games with coalition structures

Many game-theoretic solution notions have been defined or can be defined not only with reference to the all-player coalition, but also with reference to an arbitrary coalition structure. In this paper, theorems are established that connect a given solution notion, defined for a coalition structure ? with the same solution notion applied to appropriately defined games on each of the coalitions in ?. This is done for the kernel, nucleolus, bargaining set, value, core, and thevon Neumann-Morgenstern solution. It turns out that there is a single function that plays the central role in five out of the six solution notions in question, though each of these five notions is entirely different. This is an unusual instance of a game theoretic phenomenon that does not depend on a particular solution notion but holds across a wide class of such notions.     

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty

The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes of bounded uncertainties, including the matrix 1-norm uncertainty, the rank-1 uncertainty and the columnwise affine parameter uncertainty.     

Cooperative games and cost allocation problems

The objective of this paper is to provide a general view of the literature of applications of transferable utility cooperative games to cost allocation problems. This literature is so large that we concentrate on some relevant contributions in three specific areas: transportation, natural resources and power industry. We stress those applications dealing with costs and with problems arisen outside the academic world.     

Cooperative interval games: a survey

The (re)distribution of collective gains and costs is a central question for individuals and organizations contemplating cooperation under uncertainty. The theory of cooperative interval games provides a new game theoretical angle and suitable tools for answering this question. This survey aims to briefly present the state-of-the-art in this young field of research, discusses how the model of cooperative interval games extends the cooperative game theory literature, and reviews its existing and potential applications in economic and operations research situations with interval data.     

Reflected backward stochastic differential equations with two barriers and Dynkin games under Knightian uncertainty

This paper is concerned with a class of reflected backward stochastic differential equations (RBSDEs in short) with two barriers. The first purpose of the paper is to establish existence and uniqueness results of adapted solutions for such RBSDEs. Most of existing results on adapted solutions for RBSDEs with two barriers are heavily based on either the Mokobodski condition or other restrictive regularity conditions. In this paper, the two barriers are modeled by stochastic differential equations with coefficients satisfying the local Lipschitz condition and the linear growth condition, which enables us to weaken the regularity conditions on the boundary processes. Existence is proved by a penalization scheme together with a comparison theorem under the Lipschitz condition on the coefficients of RBSDEs. As an application, it is proved that the initial value of an RBSDE with two barriers coincides with the value function of a certain Dynkin game under Knightian uncertainty.     

Cooperative equilibria in discounted stochastic sequential games

This paper addresses the problem of computation of cooperative equilibria in discounted stochastic sequential games. The proposed approach contains as a special case the method of Green and Porter (developed originally for repeated oligopoly games), but it is more general than the latter in the sense that it generates nontrivial equilibrium solutions for a much larger class of dynamic games. This fact is demonstrated on two examples, one concerned with duopolistic economics and the other with fishery management.     

Cooperative oligopoly games with boundedly rational firms

We analyze cooperative Cournot games with boundedly rational firms. Due to cognitive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value using simple heuristics. In particular, they assign various non-equilibrium probability distributions over the outsiders’ set of partitions. We construct the characteristic function of a coalition in such an environment and we analyze the core of the corresponding games. We show that the core is non-empty provided the number of firms in the market is sufficiently large. Moreover, we show that if two distributions over the set of partitions are related via first-order dominance, then the core of the game under the dominated distribution is a subset of the core under the dominant distribution.     

Cooperative games: historical problems, modern theory

since childhood, we know (and not only from pirate movies and stories) that nothing is trickier than dividing money. In the world around us, both individuals and organizations practice it every day. Cooperative game theory provides a scientific approach to the problem of fair dividing of a given sum. In this paper, I     

Cooperative grey games and the grey Shapley value

This contribution is located in the common area of operational research and economics, with a close relation and joint future potential with optimization: game theory. We focus on collaborative game theory under uncertainty. This study is on a new class of cooperative games where the set of players is finite and the coalition values are interval grey numbers. An interesting solution concept, the grey Shapley value, is introduced and characterized with the properties of additivity, efficiency, symmetry and dummy player, which are straightforward generalizations of the corresponding properties in the classical cooperative game theory. The paper ends with a conclusion and an outlook to future studies.     

Dynamic games in management science with interest rate uncertainty

This paper incorporates interest rate uncertainty in differential games applied in management science. A solution mechanism for games with uncertain interest rates is developed, and a novel characterizing the solution is established. This is the first time differential games with uncertain interest rates are developed and solved. An application in commercial resource extraction is provided. In particular, the impact of interest rate variations on the value of the firm is presented in a dynamic game framework. Numerical illustrations and computer generated results are presented. The analysis is also extended to cases with stochastic dynamics.     

Closedness under reduced games

We will introduce the notation of the generalized reduced game to unify the representations for maximal subclasses of the classes of essential games (superadditive games and convex games) that are closed under reduction in the sense of Sobolev (1975), Hart and Mas-Colell (1989), and Moulin (1985), respectively.