Pages that link to "Item:Q943868"
From MaRDI portal
The following pages link to Inapproximability results for combinatorial auctions with submodular utility functions (Q943868):
Displaying 17 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)
- Algorithmic Aspects of Private Bayesian Persuasion. (Q4638086) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- (Q5009516) (← links)
- (Q5090397) (← links)
- (Q5111732) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
