Showing 1 - 10 of 59
Uniform{price assignment games are introduced as those assignment mar- kets with the core reduced to a segment. In these games, for all active agents, competitive prices are uniform although products may be non-homogeneous. A characterization in terms of the assignment matrix is given. The only...
Persistent link: https://www.econbiz.de/10005022371
In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyerseller exact games and satisfy the condition that each mixedpair coalition attains the corresponding matrix...
Persistent link: https://www.econbiz.de/10005138825
We extend Rochfords (1983) notion of symmetrically pairwise-bargained equilibrium to assignment games with more than two sides. A symmetrically multilateral-bargained (SMB) allocation is a core allocation such that any agent is in equilibrium with respect to a negotiation process among all...
Persistent link: https://www.econbiz.de/10005022339
There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of...
Persistent link: https://www.econbiz.de/10005022346
Persistent link: https://www.econbiz.de/10009292855
Persistent link: https://www.econbiz.de/10008468247
We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with nonnegative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of...
Persistent link: https://www.econbiz.de/10005138819
In the framework of two-sided assignment markets, we first consider that among several markets, the players may choose where to trade. It is shown that the corresponding game, represented by the maximum of a finite set of assignment games, may not be balanced. Some conditions for balancedness...
Persistent link: https://www.econbiz.de/10005176408
The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the...
Persistent link: https://www.econbiz.de/10005176415
Singlevalued solutions for the case of twosided market games without product differentiation, also known as B ohmBawerk horse market games, are analyzed. The nucleolus is proved to coincide with the value, and is thus the midpoint of the core. Moreover a characterization of this set of games in...
Persistent link: https://www.econbiz.de/10005600429