Pages that link to "Item:Q5741796"
From MaRDI portal
The following pages link to Communication Complexity of Combinatorial Auctions with Submodular Valuations (Q5741796):
Displaying 4 items.
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Almost Envy-Freeness with General Valuations (Q5107066) (← links)
- The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019) (← links)
- Algorithms - ESA 2003 (Q5897238) (← links)