Activity optimization games with complementarity (Q1091957): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Milan Mareš / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Milan Mareš / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes—On a Selection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally balanced games arising from controlled programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / 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: Generalized Network Problems Yielding Totally Balanced Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Submodular Function on a Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activity selection games and the minimum‐cut problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 18 June 2024

scientific article
Language Label Description Also known as
English
Activity optimization games with complementarity
scientific article

    Statements

    Activity optimization games with complementarity (English)
    0 references
    0 references
    1987
    0 references
    A certain general class of cooperative games, namely the activity optimization games with complementarity, are investigated. It is shown that those games are convex, and consequently their cores are non-empty. Further results concern the properties of the optimal activity levels and some further game.
    0 references
    core
    0 references
    nonemptiness
    0 references
    convexity
    0 references
    activity optimization games with complementarity
    0 references
    0 references

    Identifiers