Pages that link to "Item:Q2516249"
From MaRDI portal
The following pages link to Limitations of randomized mechanisms for combinatorial auctions (Q2516249):
Displaying 9 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- Mechanisms for combinatorial auctions with budget constraints (Q2318114) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
