Pages that link to "Item:Q5171216"
From MaRDI portal
The following pages link to On the Power of Randomization in Algorithmic Mechanism Design (Q5171216):
Displaying 13 items.
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← 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)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Optimizing maintenance service contracts through mechanism design theory (Q2293743) (← links)
- The power of randomness in Bayesian optimal mechanism design (Q2347783) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- Truthfulness and Approximation with Value-Maximizing Bidders (Q2819462) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension (Q4602545) (← links)
- (Q5743441) (← links)