Two-sided capacitated submodular maximization in gig platforms

DOI10.1007/978-3-031-48974-7_34MaRDI QIDQ6609176zbMATH OpenFDO

Authors Pan Xu

Publication date 20 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48974-7_34

Mathematics Subject Classification ID

Internet topics (68M11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• Constrained submodular maximization via greedy local search
• Dependent rounding and its applications to approximation algorithms
• Online budgeted maximum coverage
• Online Stochastic Matching: Beating 1-1/e
• Online stochastic matching: new algorithms and bounds
• Online stochastic matching: new algorithms with better bounds
• Online stochastic weighted matching: improved approximation algorithms
• Online submodular maximization with free disposal: randomization beats \(\frac{1}{4}\) for partition matroids
• Online submodular maximization with preemption
• Online submodular welfare maximization: greedy beats 1/2 in random order
• Online submodular welfare maximization: greedy is optimal
• Optimal approximation for the submodular welfare problem in the value oracle model
• Structured Robust Submodular Maximization: Offline and Online Algorithms
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Submodular maximization over multiple matroids via generalized exchange properties

This page was built for publication: Two-sided capacitated submodular maximization in gig platforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609176)