On the public citation graph

Spatial Matching with Delays

https://doi.org/10.2139/ssrn.5162095
0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.21872openalex-snapshot
Dynamic pricing and matching in ride‐hailing platforms
inferredcites →https://doi.org/10.1002/net.3230130404openalex-snapshot
A survey of heuristics for the weighted matching problem
inferredcites →https://doi.org/10.1007/3-540-54233-7_178openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferredcites →https://doi.org/10.1007/978-3-030-64946-3_2openalex-snapshot
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_47openalex-snapshot
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
inferredcites →https://doi.org/10.1016/0020-0190(81)90103-4openalex-snapshot
Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
inferredcites →https://doi.org/10.1016/0167-6377(90)90066-eopenalex-snapshot
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
inferredcites →https://doi.org/10.1017/s0004972709000707openalex-snapshot
THE AVERAGE DISTANCE BETWEEN TWO POINTS
inferredcites →https://doi.org/10.1017/s0269964800000711openalex-snapshot
Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
inferredcites →https://doi.org/10.1086/704761openalex-snapshot
Thickness and Information in Dynamic Matching Markets
inferredcites →https://doi.org/10.1214/aop/1176994411openalex-snapshot
Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability
inferredcites →https://doi.org/10.1287/13-ssy097openalex-snapshot
On the Dynamic Control of Matching Queues
inferredcites →https://doi.org/10.1287/mnsc.2021.01215openalex-snapshot
Dynamic Matching: Characterizing and Achieving Constant Regret
inferredcites →https://doi.org/10.1287/mnsc.2021.4245openalex-snapshot
Food Delivery Service and Restaurant: Friend or Foe?
inferredcites →https://doi.org/10.1287/mnsc.2022.4390openalex-snapshot
Managing Relationships Between Restaurants and Food Delivery Platforms: Conflict, Contracts, and Coordination
inferredcites →https://doi.org/10.1287/mnsc.2023.4858openalex-snapshot
Courier Dispatch in On-Demand Delivery
inferredcites →https://doi.org/10.1287/moor.2022.1289openalex-snapshot
Edge-Weighted Online Windowed Matching
inferredcites →https://doi.org/10.1287/msom.2020.0952openalex-snapshot
Dynamic Type Matching
inferredcites →https://doi.org/10.1287/msom.2021.0354openalex-snapshot
Market Thickness in Online Food Delivery Platforms: The Impact of Food Processing Times
inferredcites →https://doi.org/10.1287/opre.2017.1644openalex-snapshot
Efficient Dynamic Barter Exchange
inferredcites →https://doi.org/10.1287/opre.2021.0588openalex-snapshot
Provably Good Region Partitioning for On-Time Last-Mile Delivery
inferredcites →https://doi.org/10.1287/opre.2021.2233openalex-snapshot
Dynamic Pricing and Matching for Two-Sided Queues
inferredcites →https://doi.org/10.1287/opre.2022.2293openalex-snapshot
Dynamic Stochastic Matching Under Limited Time
inferredcites →https://doi.org/10.1287/opre.2022.2399openalex-snapshot
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation
inferredcites →https://doi.org/10.1609/aaai.v37i10.26417openalex-snapshot
Fully Online Matching with Stochastic Arrivals and Departures
inferredcites →https://doi.org/10.2139/ssrn.4021586openalex-snapshot
Pigeonhole Design: Balancing Sequential Experiments from an Online Matching Perspective
inferredcites →https://doi.org/10.48550/arxiv.1606.03626openalex-snapshot
On Matching and Thickness in Heterogeneous Dynamic Markets
inferredcites →https://doi.org/10.48550/arxiv.2112.04622openalex-snapshot
Greedy Algorithm for Multiway Matching with Bounded Regret
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.