The value of shared information for allocation of drivers in ride-hailing: a proof-of-concept study
From MaRDI portal
Publication:6149568
DOI10.1007/s10287-023-00487-7arXiv2201.00061OpenAlexW4388420009MaRDI QIDQ6149568
Gianfranco Liberona, Léonard von Niederhäusern, David Salas
Publication date: 6 February 2024
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00061
Cites Work
- Unnamed Item
- Interdependent network restoration: on the value of information-sharing
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Revisiting the value of information sharing in two-stage supply chains
- Foundations of bilevel programming
- The value of information for price dependent demand
- Information sharing in an e-tailing supply chain for fresh produce with freshness-keeping effort and value-added service
- Julia: A Fresh Approach to Numerical Computing
- Introduction to Stochastic Programming
- Computational Difficulties of Bilevel Linear Programming
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Variational Analysis
- A Short State of the Art on Multi-Leader-Follower Games
- Bilevel Linear Optimization Under Uncertainty
- Spatial Pricing in Ride-Sharing Networks
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- Bilevel Programming Problems
- MULTI-LEADER-FOLLOWER GAMES: MODELS, METHODS AND APPLICATIONS
- Convex analysis and monotone operator theory in Hilbert spaces
- Set-valued analysis
- Dynamic pricing and matching in ride‐hailing platforms
- Matching Drivers to Riders: A Two-Stage Robust Approach
This page was built for publication: The value of shared information for allocation of drivers in ride-hailing: a proof-of-concept study
