Extreme points of two digraph polytopes: Description and applications in economics and game theory (Q952685): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Mathematical methods of game and economic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selectope for cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games with permission structures: The conjunctive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizations of the conjunctive permission value for games with permission structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Harsanyi set for cooperative TU-game / rank
 
Normal rank

Revision as of 19:14, 28 June 2024

scientific article
Language Label Description Also known as
English
Extreme points of two digraph polytopes: Description and applications in economics and game theory
scientific article

    Statements

    Extreme points of two digraph polytopes: Description and applications in economics and game theory (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2008
    0 references
    polytope
    0 references
    directed graph
    0 references
    unit simplex
    0 references
    unit cube
    0 references
    core
    0 references

    Identifiers