C-complete sets for compromise stable games (Q471023): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109234772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming model for product configuration optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of 1-convex \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bankruptcy approach to the core cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clan games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core cover in relation to the nucleolus and the Weber set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd marginal worth vectors, Owen's multilinear extension and convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and marginal vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing convexity of games using marginal vectors / rank
 
Normal rank

Latest revision as of 07:42, 9 July 2024

scientific article
Language Label Description Also known as
English
C-complete sets for compromise stable games
scientific article

    Statements

    C-complete sets for compromise stable games (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2014
    0 references
    The paper investigates the relationship between compromise stability of transferable utility games and efficient payoff vectors; specifically, the main results study the structure of the generators of the core cover, and conditions ensuring that the game is compromise stable.
    0 references
    0 references
    core
    0 references
    core cover
    0 references
    larginal vectors
    0 references
    TU-game
    0 references
    0 references