Pages that link to "Item:Q4997307"
From MaRDI portal
The following pages link to Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307):
Displaying 8 items.
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- Optimal item pricing in online combinatorial auctions (Q2164686) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5361892) (redirect page) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)