Pages that link to "Item:Q3581383"
From MaRDI portal
The following pages link to Approximation techniques for utilitarian mechanism design (Q3581383):
Displayed 18 items.
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Revenue maximization with a single sample (Q2347785) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Spectrum Bidding in Wireless Networks and Related (Q3511367) (← links)
- On the Approximability of Combinatorial Exchange Problems (Q5459974) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- (Q5743441) (← links)