Pages that link to "Item:Q1727952"
From MaRDI portal
The following pages link to Generalized assignment problem: truthful mechanism design without money (Q1727952):
Displaying 4 items.
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem (Q2329577) (← links)
- Electronic service matching: failure of incentive compatibility in vickrey auctions (Q2417158) (← links)
