Showing 1 - 10 of 770
A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff vectors to every TU-game. Some solutions that are based on distributing...
Persistent link: https://www.econbiz.de/10012731253
Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are nonnegative), and there is some hierarchical...
Persistent link: https://www.econbiz.de/10014046563
In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...
Persistent link: https://www.econbiz.de/10014029186
Persistent link: https://www.econbiz.de/10003783831
Persistent link: https://www.econbiz.de/10003850883
Persistent link: https://www.econbiz.de/10003408297
Persistent link: https://www.econbiz.de/10003537246
Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems, such as river games, queueing games and auction games, the game is totally positive (i.e., all dividends are nonnegative), and there is some hierarchical...
Persistent link: https://www.econbiz.de/10011378242
Recently, applications of cooperative game theory to economicallocation problems have gained popularity. To understandthese applications better, economic theory studies thesimilarities and differences between them. The purpose of thispaper is to investigate a special class of cooperative...
Persistent link: https://www.econbiz.de/10011334357
In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...
Persistent link: https://www.econbiz.de/10011335203