Hardness of and approximate mechanism design for the bike rebalancing problem

DOI10.1016/J.TCS.2019.07.030MaRDI QIDQ2283013zbMATHOpenAlexFDO

Authors Hongtao Lv, Fan Wu, Tie Luo, Xiaofeng Gao, Guihai Chen

Publication date 27 December 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2019.07.030

zbMATH Keywords

sharing economyapproximate mechanismlocation truthfulness

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mechanism design theory (91B03)

Recommendations

• Bike sharing systems: solving the static rebalancing problem
• Inventory rebalancing and vehicle routing in bike sharing systems
• A mixed rebalancing strategy in bike sharing systems
• Balancing bike sharing systems with constraint programming
• Full-load route planning for balancing bike sharing systems by logic-based benders decomposition

Cites work

• A note on greedy algorithms for the maximum weighted independent set problem
• Budget feasible mechanism design, from prior-free to Bayesian
• On the approximability of budget feasible mechanisms
• Optimal Auction Design

Cited in

(2)

• A two-phase heuristic approach to the bike repositioning problem
• Achieving location truthfulness in rebalancing supply-demand distribution for bike sharing

This page was built for publication: Hardness of and approximate mechanism design for the bike rebalancing problem

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