Efficient coordination mechanisms for unrelated machine scheduling (Q2375956): 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 / arXiv ID
 
Property / arXiv ID: 1107.1814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taxes for linear atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Network Protocols for Good Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Approximation in Potential 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: How much can taxes help selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737207 / 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: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Speed of Convergence in Congestion Games under Best-Response Dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preference-constrained oriented matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radiocoloring in planar graphs: Complexity and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic robustness of the price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524729 / rank
 
Normal rank

Latest revision as of 14:31, 6 July 2024

scientific article
Language Label Description Also known as
English
Efficient coordination mechanisms for unrelated machine scheduling
scientific article

    Statements

    Efficient coordination mechanisms for unrelated machine scheduling (English)
    0 references
    0 references
    25 June 2013
    0 references
    algorithmic game theory
    0 references
    price of anarchy
    0 references
    coordination mechanisms
    0 references
    scheduling
    0 references
    unrelated machines
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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