Hardness of and approximate mechanism design for the bike rebalancing problem

DOI10.1016/J.TCS.2019.07.030zbMATH Open1443.91095OpenAlexW2963997869MaRDI QIDQ2283013FDOQ2283013

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

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

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)

Cites Work

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

Cited In (1)

• A two-phase heuristic approach to the bike repositioning problem

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)