Showing 1 - 7 of 7
Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization...
Persistent link: https://www.econbiz.de/10005081026
We consider a market situation with two corners. One corner consists of a single seller with one object, and the other corner consists of potential buyers who all want the object. We suppose that the valuations of the object for the different buyers are known by all of them. Then two types of...
Persistent link: https://www.econbiz.de/10008475661
In many share problems there is an a priori given a natural set of possible divisions to solve the sharing problem. Cooperative games related to such share sets are introduced, which may be helpful in solving share problems. Relations between properties of share sets and properties of games are...
Persistent link: https://www.econbiz.de/10004977737
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...
Persistent link: https://www.econbiz.de/10005012066
In this paper we consider a special class of n-person potential games and investigate partial cooperation between a portion of the players that sign a cooperative agreement. Existence results of partial cooperative equilibria are obtained and some possible applications are discussed,...
Persistent link: https://www.econbiz.de/10005047540
This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. We analyze these situations by means of cooperative games with random payoffs. Special attention is paid to three types of convexity, namely coalitional-merge,...
Persistent link: https://www.econbiz.de/10005047564
We give a non-cooperative and an axiomatic characterization of the Average Lexicographic value (AL-value) on the class of balanced games. The AL-value is a single-valued solution for balanced TU-games. It is defined as the average of lexicographic maximum of the core of the game with respect to...
Persistent link: https://www.econbiz.de/10009018947