Extreme points of two digraph polytopes: Description and applications in economics and game theory
In this paper, we introduce two polytopes that respect a digraph in the sense that for every vector in the polytope every component corresponds to a node and is at least equal to the component corresponding to each successor of this node. The sharing polytope is the set of all elements from the unit simplex that respect the digraph. The fuzzy polytope is the set of all elements of the unit cube respecting the digraph. The main results are characterizations of the extreme points of the above described two digraph polytopes. We also give an economic application of the result on the sharing polytope and a game-theoretical application for the fuzzy polytope.
Year of publication: |
2008
|
---|---|
Authors: | van den Brink, René ; van der Laan, Gerard ; Vasil'ev, Valeri |
Published in: |
Journal of Mathematical Economics. - Elsevier, ISSN 0304-4068. - Vol. 44.2008, 11, p. 1114-1125
|
Publisher: |
Elsevier |
Keywords: | Polytope Directed graph Unit simplex Unit cube Core |
Saved in:
Saved in favorites
Similar items by person
-
Harsanyi Solutions in Line-graph Games
van den Brink, René, (2003)
-
Distributing Dividends in Games with Ordered Players
van den Brink, René, (2007)
-
van den Brink, René, (2004)
- More ...