Two-sided capacitated submodular maximization in gig platforms
From MaRDI portal
Publication:6609176
DOI10.1007/978-3-031-48974-7_34MaRDI QIDQ6609176
Publication date: 20 September 2024
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)
Cites Work
- Unnamed Item
- Online stochastic matching: new algorithms and bounds
- Constrained submodular maximization via greedy local search
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Online Stochastic Weighted Matching: Improved Approximation Algorithms
- Dependent rounding and its applications to approximation algorithms
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
- Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids
- Online Budgeted Maximum Coverage
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- Online Stochastic Matching: Beating 1-1/e
- Online Stochastic Matching: New Algorithms with Better Bounds
- Online Submodular Maximization with Preemption
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Online submodular welfare maximization: Greedy is optimal
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
This page was built for publication: Two-sided capacitated submodular maximization in gig platforms
