On the price of anarchy of two-stage machine scheduling games (Q2051911): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q126842980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum load: the cost of selfishness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant scheduling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner product spaces for MinSum coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of selfishness for maximizing the minimum load on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy on uniformly related machines revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a network creation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy in large games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for LPT Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Anarchy for Minsum Related Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the inefficiency of equilibria in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of equilibria for the machine covering game on uniform machines / rank
 
Normal rank

Latest revision as of 08:17, 27 July 2024

scientific article
Language Label Description Also known as
English
On the price of anarchy of two-stage machine scheduling games
scientific article

    Statements

    On the price of anarchy of two-stage machine scheduling games (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    price of anarchy
    0 references
    scheduling
    0 references
    coordination mechanisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references