From cost sharing mechanisms to online selection problems
From MaRDI portal
Publication:3449447
Recommendations
Cites work
- scientific article; zbMATH DE number 5764798 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086941 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A General Approximation Technique for Constrained Forest Problems
- A cost-sharing method for an economic lot-sizing game
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A group-strategyproof mechanism for Steiner forests
- A note on the prize collecting traveling salesman problem
- Algorithms for facility location problems with outliers. (Extended abstract)
- An \(O(\log n)\)-competitive algorithm for online constrained forest problems
- An improved LP-based approximation for Steiner tree
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Cost Sharing Methods for Makespan and Completion Time Scheduling
- Cost sharing
- Dynamic Steiner Tree Problem
- Dynamic version of the economic lot size model
- Equitable cost allocations via primal-dual-type algorithms
- Fully distribution-free profit maximization: the inventory management case
- Game-theoretic analysis of cooperation among supply chain agents: Review and extensions
- Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Integrated market selection and production planning: complexity and solution approaches
- New efficiency results for makespan cost sharing
- New trade-offs in cost-sharing mechanisms
- On the competitive ratio for online facility location
- Online algorithms: a survey
- Online traveling salesman problems with rejection options
- Optimal Efficiency Guarantees for Network Design Mechanisms
- Requirements Planning with Pricing and Order Selection Flexibility
- Steiner Minimal Trees
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Supply chain management with online customer selection
- The prize collecting traveling salesman problem
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- Worst case performance for lot sizing heuristics
- Worst-case analysis for a general class of online lot-sizing heuristics
Cited in
(7)- Supply chain management with online customer selection
- Sharing the cost more efficiently
- From packing rules to cost-sharing mechanisms
- Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems
- Cost-sharing strategy for carbon emission reduction and sales effort: a Nash game with government subsidy
- Online cooperative cost sharing
- A review of revenue management: recent generalizations and advances in industry applications
This page was built for publication: From cost sharing mechanisms to online selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449447)
