Pages that link to "Item:Q3002824"
From MaRDI portal
The following pages link to The submodular welfare problem with demand queries (Q3002824):
Displaying 24 items.
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Simultaneous selection (Q906442) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- Combinatorial auctions with endowment effect (Q2100637) (← links)
- Approximation algorithms for the partial assignment problem (Q2197546) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- A simple optimal contention resolution scheme for uniform matroids (Q2699957) (← links)
- On maximizing welfare when utility functions are subadditive (Q2931368) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Combinatorial Auctions with Conflict-Based Externalities (Q3460791) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) (← links)
- On Maximizing Welfare When Utility Functions Are Subadditive (Q5189541) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)
- Ascending-price mechanism for general multi-sided markets (Q6067051) (← links)