Pages that link to "Item:Q511705"
From MaRDI portal
The following pages link to A coordination mechanism for a scheduling game with parallel-batching machines (Q511705):
Displaying 14 items.
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (Q2686108) (← links)
- Optimal Coordination Mechanisms for Multi-job Scheduling Games (Q2921388) (← links)
- (Q2993707) (← links)
- (Q3516473) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- Achieving optimal backlog in multi-processor cup games (Q5212854) (← links)
- Scheduling games with machine-dependent priority lists (Q5896089) (← links)
- Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games (Q6119818) (← links)
- Choosing a batch to be processed (Q6165388) (← links)