Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (Q2686108): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cost-sharing scheduling games on restricted unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Coordination Mechanisms for Unrelated Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency analysis of load balancing games with and without activation costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Nash equilibria in anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflicting Congestion Effects in Resource Allocation Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium inefficiency in resource buying games with load-dependent costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pure Nash Equilibria in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of equilibria for scheduling game with machine activation costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest first coordination mechanism for a scheduling game with parallel-batching machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling games on uniform machines with activation cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4690851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost / rank
 
Normal rank

Latest revision as of 13:33, 31 July 2024

scientific article
Language Label Description Also known as
English
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
scientific article

    Statements

    Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 February 2023
    0 references
    batching-scheduling game
    0 references
    Nash equilibrium
    0 references
    approximate Nash equilibrium
    0 references
    mixed strategy Nash equilibrium
    0 references
    price of anarchy
    0 references
    price of stability
    0 references

    Identifiers