Budget-constrained cost-covering job assignment for a total contribution-maximizing platform

DOI10.1007/978-3-031-34347-6_33OpenAlexW4379134851MaRDI QIDQ6182924

Chi-Hao Wang, Po-An Chen, Chuang-Chieh Lin, Ming-Tat Ko, Chi-Jen Lu

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_33

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The budgeted maximum coverage problem
• Bees algorithm for generalized assignment problem
• Bayesian Incentive-Compatible Bandit Exploration
• Tight approximation algorithms for maximum general assignment problems

This page was built for publication: Budget-constrained cost-covering job assignment for a total contribution-maximizing platform