Pages that link to "Item:Q3541092"
From MaRDI portal
The following pages link to A Characterization of 2-Player Mechanisms for Scheduling (Q3541092):
Displayed 7 items.
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← 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)
- The polyhedral geometry of truthful auctions (Q6086004) (← links)