Maximum latency scheduling problem on two-person cooperative games (Q358650): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2886016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4672944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash bargaining theory when the number of alternatives can be finite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of the Kalai-Smorodinsky solution when the feasible sets can be finite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Person Cooperative Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank

Latest revision as of 18:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Maximum latency scheduling problem on two-person cooperative games
scientific article

    Statements

    Maximum latency scheduling problem on two-person cooperative games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2013
    0 references
    scheduling
    0 references
    two-person cooperative game
    0 references
    cooperative profits
    0 references
    dynamic programming algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references