Pages that link to "Item:Q1041343"
From MaRDI portal
The following pages link to On truthfulness and approximation for scheduling selfish tasks (Q1041343):
Displaying 19 items.
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Fair resource allocation for different scenarios of demands (Q439500) (← links)
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines (Q764300) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Scheduling without payments (Q1678760) (← 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)
- The anarchy of scheduling without money (Q2420568) (← links)
- Truthful approximation mechanisms for scheduling selfish related machines (Q2643141) (← links)
- Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments (Q5268114) (← links)
- Mechanism design with uncertain inputs (Q5419125) (← links)
- Prior-independent mechanisms for scheduling (Q5495775) (← links)
- Structural Information and Communication Complexity (Q5710093) (← links)
- STACS 2005 (Q5710720) (← links)
