On the public citation graph

Greedy Matching of Impatient Agents: The Role of Inventory

https://doi.org/10.2139/ssrn.4804794
0 signed · 56 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.1007/978-3-030-64946-3_2openalex-extracted
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
inferredcites →https://doi.org/10.1007/978-3-642-02547-1openalex-extracted
Continuous-Time Markov Decision Processes : Theory and Applications
inferredcites →https://doi.org/10.1007/s11134-010-9201-2openalex-extracted
Dynamic control of a single-server system with abandonments
inferredcites →https://doi.org/10.1007/s11134-012-9325-7openalex-extracted
Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
inferredcites →https://doi.org/10.1007/s11134-018-9589-7openalex-extracted
Diffusion approximations for double-ended queues with reneging in heavy traffic
inferredcites →https://doi.org/10.1007/s11134-020-09662-yopenalex-extracted
Matching queues with reneging: a product form solution
inferredcites →https://doi.org/10.1016/s0305-0548(01)00075-2openalex-extracted
Double-ended queues with impatience
inferredcites →https://doi.org/10.1017/s002190020000797xopenalex-extracted
Managing Queues with Heterogeneous Servers
inferredcites →https://doi.org/10.1023/a:1021804515162openalex-extracted
A Diffusion Approximation for a Markovian Queue with Reneging
inferredcites →https://doi.org/10.1080/00401706.1995.10484354openalex-extracted
Markov Decision Processes: Discrete Stochastic Dynamic Programming
inferredcites →https://doi.org/10.1086/704761openalex-extracted
Thickness and Information in Dynamic Matching Markets
inferredcites →https://doi.org/10.1093/restud/rdac044openalex-extracted
Matching in Dynamic Imbalanced Markets
inferredcites →https://doi.org/10.1111/ajt.14566openalex-extracted
Effect of match-run frequencies on the number of transplants and waiting times in kidney exchange
inferredcites →https://doi.org/10.1111/trf.16380openalex-extracted
Conservation of Rh negative Low Titer O Whole Blood (LTOWB) and the need for a national conversation to define its use in trauma transfusion protocols
inferredcites →https://doi.org/10.1145/3529113.3529127openalex-extracted
A Heavy Traffic Theory of Two-Sided Queues
inferredcites →https://doi.org/10.1214/06-ps091openalex-extracted
Martingale proofs of many-server heavy-traffic limits for Markovian queues
inferredcites →https://doi.org/10.1214/13-ssy097openalex-extracted
On the Dynamic Control of Matching Queues
inferredcites →https://doi.org/10.1214/13-ssy113openalex-extracted
Diffusion models for double-ended queues with renewal arrival processes
inferredcites →https://doi.org/10.1257/jep.31.4.145openalex-extracted
How Food Banks Use Markets to Feed the Poor
inferredcites →https://doi.org/10.1287/13-ssy113openalex-extracted
Diffusion Models for Double-Ended Queues with Renewal Arrival Processes
inferredcites →https://doi.org/10.1287/inte.2015.0828openalex-extracted
The Pennsylvania Adoption Exchange Improves Its Matching Process
inferredcites →https://doi.org/10.1287/mnsc.2018.3220openalex-extracted
Online Resource Allocation with Limited Flexibility
inferredcites →https://doi.org/10.1287/mnsc.2019.3311openalex-extracted
Design of Lotteries and Wait-Lists for Affordable Housing Allocation
inferredcites →https://doi.org/10.1287/mnsc.2020.3622openalex-extracted
Surge Pricing and Its Spatial Supply Response
inferredcites →https://doi.org/10.1287/mnsc.2021.01215openalex-extracted
Dynamic Matching: Characterizing and Achieving Constant Regret
inferredcites →https://doi.org/10.1287/mnsc.2022.4448openalex-extracted
Delay Information in Virtual Queues: A Large-Scale Field Experiment on a Major Ride-Sharing Platform
inferredcites →https://doi.org/10.1287/mnsc.2022.4601openalex-extracted
Designing Approximately Optimal Search on Matching Platforms
inferredcites →https://doi.org/10.1287/mnsc.2023.01513openalex-extracted
The Cost of Impatience in Dynamic Matching: Scaling Laws and Operating Regimes
inferredcites →https://doi.org/10.1287/moor.2022.1289openalex-extracted
Edge-Weighted Online Windowed Matching
inferredcites →https://doi.org/10.1287/msom.2020.0952openalex-extracted
Dynamic Type Matching
inferredcites →https://doi.org/10.1287/msom.2024.0774openalex-extracted
Matching Queues, Flexibility, and Incentives
inferredcites →https://doi.org/10.1287/opre.1100.0826openalex-extracted
The cμ/θ Rule for Many-Server Queues with Abandonment
inferredcites →https://doi.org/10.1287/opre.2018.1782openalex-extracted
Approximations to Stochastic Dynamic Programs via Information Relaxation Duality
inferredcites →https://doi.org/10.1287/opre.2018.1819openalex-extracted
Optimal Signaling Mechanisms in Unobservable Queues
inferredcites →https://doi.org/10.1287/opre.2018.1826openalex-extracted
On Matching and Thickness in Heterogeneous Dynamic Markets
inferredcites →https://doi.org/10.1287/opre.2020.2027openalex-extracted
On the Optimal Design of a Bipartite Matching Queueing System
inferredcites →https://doi.org/10.1287/opre.2021.0596openalex-extracted
On the Optimality of Greedy Policies in Dynamic Matching
inferredcites →https://doi.org/10.1287/opre.2021.2186openalex-extracted
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities
inferredcites →https://doi.org/10.1287/opre.2022.0035openalex-extracted
Reshaping National Organ Allocation Policy
inferredcites →https://doi.org/10.1287/opre.2022.2293openalex-extracted
Dynamic Stochastic Matching Under Limited Time
inferredcites →https://doi.org/10.1287/opre.2022.2399openalex-extracted
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation
inferredcites →https://doi.org/10.1287/opre.2022.2400openalex-extracted
Technical Note—Greedy Algorithm for Multiway Matching with Bounded Regret
inferredcites →https://doi.org/10.1287/opre.2023.0032openalex-extracted
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis
inferredcites →https://doi.org/10.1287/stsy.2017.0001openalex-extracted
A Blood Bank Model with Perishable Blood and Demand Impatience
inferredcites →https://doi.org/10.1287/stsy.2019.0037openalex-extracted
Dynamic Matching for Real-Time Ride Sharing
inferredcites →https://doi.org/10.2139/ssrn.2794679openalex-extracted
Online Resource Allocation with Limited Flexibility
inferredcites →https://doi.org/10.2139/ssrn.3678986openalex-extracted
Allocation of COVID-19 Vaccines Under Limited Supply
inferredcites →https://doi.org/10.3982/te3740openalex-extracted
Optimal dynamic matching
inferredcites →https://doi.org/10.48550/arxiv.1606.03626openalex-extracted
On Matching and Thickness in Heterogeneous Dynamic Markets
inferredcites →https://doi.org/10.48550/arxiv.2102.02710openalex-extracted
Matching Impatient and Heterogeneous Demand and Supply
inferredcites →https://doi.org/10.48550/arxiv.2102.09017openalex-extracted
Designing Approximately Optimal Search on Matching Platforms
inferredcites →https://doi.org/10.48550/arxiv.2112.04622openalex-extracted
Greedy Algorithm for Multiway Matching with Bounded Regret
inferredcites →https://doi.org/10.1101/2020.08.23.20179820openalex-snapshot
Allocation of COVID-19 Vaccines Under Limited Supply
inferredcites →https://doi.org/10.1239/jap/1308662637openalex-snapshot
Managing Queues with Heterogeneous Servers
inferredcites →https://doi.org/10.1287/13-ssy097openalex-snapshot
On the Dynamic Control of Matching Queues
inferredcites →https://doi.org/10.2307/1269932openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming
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.