Pages that link to "Item:Q2884315"

The following pages link to Optimal Lower Bounds for Anonymous Scheduling Mechanisms (Q2884315):

Displaying 17 items.

• Truthful mechanism design via correlated tree rounding (Q526848) (← links)
• The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
• Mechanisms for scheduling with single-bit private values (Q904689) (← links)
• Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
• Setting lower bounds on truthfulness (Q1651232) (← 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)
• Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
• The anarchy of scheduling without money (Q2420568) (← links)
• Mechanism design with a restricted action space (Q2437830) (← links)
• Bayesian optimal knapsack procurement (Q2514780) (← links)
• Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
• Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
• The Anarchy of Scheduling Without Money (Q2819467) (← links)
• Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
• The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
• A new lower bound for deterministic truthful scheduling (Q5918088) (← links)