Pages that link to "Item:Q1031874"

The following pages link to A lower bound for scheduling mechanisms (Q1031874):

Displaying 18 items.

• Truthful mechanism design via correlated tree rounding (Q526848) (← links)
• Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
• The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
• The price of envy-freeness in machine scheduling (Q899310) (← links)
• Mechanisms for scheduling with single-bit private values (Q904689) (← links)
• Setting lower bounds on truthfulness (Q1651232) (← links)
• Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
• No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• Mechanism design with a restricted action space (Q2437830) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
• Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
• The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
• (Q5111230) (← links)
• A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
• Well-behaved online load balancing against strategic jobs (Q6090218) (← links)