Pages that link to "Item:Q904689"

The following pages link to Mechanisms for scheduling with single-bit private values (Q904689):

Displaying 3 items.

• No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
• Online scheduling of jobs with favorite machines (Q2289948) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)