The price of anarchy on uniformly related machines revisited (Q418148): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2012.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005432425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in cost sharing connection games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence time to Nash equilibrium in load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Price of Anarchy for Machine Load Balancing / 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: The structure and complexity of Nash equilibria for a selfish routing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate equilibria and ball fusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter approximation bounds for LPT scheduling in two special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Algorithm for Some Uniform Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:13, 5 July 2024

scientific article
Language Label Description Also known as
English
The price of anarchy on uniformly related machines revisited
scientific article

    Statements

    The price of anarchy on uniformly related machines revisited (English)
    0 references
    0 references
    0 references
    24 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    price of anarchy
    0 references
    scheduling
    0 references
    related machines
    0 references
    0 references