Pages that link to "Item:Q5244865"
From MaRDI portal
The following pages link to Truthful Generalized Assignments via Stable Matching (Q5244865):
Displaying 9 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- Primary versus secondary infrastructure capacity allocation mechanisms (Q2158023) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Truthful Mechanisms for Matching and Clustering in an Ordinal World (Q2959835) (← links)
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
- A Truthful Cardinal Mechanism for One-Sided Matching (Q5146917) (← links)
- Auction design for value maximizers with budget and return-on-spend constraints (Q6609167) (← links)