Extreme points of two digraph polytopes: Description and applications in economics and game theory

DOI10.1016/j.jmateco.2007.10.007zbMath1152.90013OpenAlexW1554609622MaRDI QIDQ952685

René van den Brink, Gerard van der Laan, Valeri A. Vasil'ev

Publication date: 13 November 2008

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2007.10.007

zbMATH Keywords

polytopecoredirected graphunit cubeunit simplex

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items (1)

Constrained core solutions for totally positive games with ordered players

Cites Work

• Games with permission structures: The conjunctive approach
• The Harsanyi set for cooperative TU-game
• Axiomatizations of the conjunctive permission value for games with permission structures
• The selectope for cooperative games
• Mathematical methods of game and economic theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extreme points of two digraph polytopes: Description and applications in economics and game theory