Pages that link to "Item:Q861258"
From MaRDI portal
The following pages link to Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258):
Displaying 16 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines (Q764300) (← links)
- Coordination mechanisms (Q838145) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- Improving the price of anarchy for selfish routing via coordination mechanisms (Q2249743) (← links)
- Two agent scheduling with a central selection mechanism (Q2355710) (← links)
- Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Asynchronous Congestion Games (Q3655138) (← links)
