Showing 1 - 10 of 27
In this paper we characterize the class of games for which the core coincides with the core cover (compromise stable games).Moreover we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems.Also the class of convex...
Persistent link: https://www.econbiz.de/10011090315
Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games.Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of...
Persistent link: https://www.econbiz.de/10011090474
For cooperative games with transferable utility, convexity has turned out to be an important and widely applicable concept.Convexity can be defined in a number of ways, each having its own specific attractions.Basically, these definitions fall into two categories, namely those based on a...
Persistent link: https://www.econbiz.de/10011090592
Abstract: In this paper we provide a characterisation of the set of fall back equilibria for 2 x n bimatrix games. Furthermore, for this type of games we discuss the relation between the set of fall back equilibria and the sets of perfect, proper and strictly perfect equilibria. In order to do...
Persistent link: https://www.econbiz.de/10011092036
Persistent link: https://www.econbiz.de/10011092664
This paper introduces a new class of transferable-utility games, called multi-issue allocation games.These games arise from various allocation situations and are based on the concepts underlying the bankruptcy model, as introduced by O'Neill (1982).In this model, a perfectly divisible good...
Persistent link: https://www.econbiz.de/10011092903
Persistent link: https://www.econbiz.de/10011091479
This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is...
Persistent link: https://www.econbiz.de/10011092611
A vector of balanced weights infers an inequality that games with a nonempty core obey.This paper gives a generalization of the notion `vector of balanced weights'.Herewith it provides necessary and sufficient conditions to determine whether a TU-game has a population monotonic allocation scheme...
Persistent link: https://www.econbiz.de/10011092785
In this paper we consider communication situations in which utility is nontransferable. We compare this model with the more familiar model of transferable utility communication situations and point out an odd feature of the latter. We mainly focus on the inheritance of properties of the...
Persistent link: https://www.econbiz.de/10011092686