Pages that link to "Item:Q506527"
From MaRDI portal
The following pages link to Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527):
Displaying 3 items.
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
