Quick or cheap? Breaking points in dynamic markets
From MaRDI portal
Publication:6559466
DOI10.1016/j.jmateco.2024.102987zbMATH Open1544.91226MaRDI QIDQ6559466
Unnamed Author, Panayotis Mertikopoulos, Bary S. R. Pradelski
Publication date: 21 June 2024
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal assignment of durable objects to successive agents
- Über kombinatorische Eigenschaften von Matrizen.
- Graphen und Matrices.
- Random assignment problems
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- A proof of Parisi's conjecture on the random assignment problem
- Über einen Satz der Wahrscheinlichkeitsrechnung.
- Orders of infinity: The `Infinitärcalül' of \textit{Paul du Bois-Reymond}.
- Sull' integrazione per parti.
- Sur les fonctions convexes et les inégalités entre les valeurs moyennes.
- Minimum cost perfect matching with delays for two sources
- Scheduling with batching: A review
- Optimal market thickness
- The ?(2) limit in the random assignment problem
- Bayesian Mechanism Design
- On the Expected Value of a Random Assignment Problem
- Optimal Control of a Paired-Kidney Exchange Program
- Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model
- On the expected value of the minimum assignment
- Dynamic Kidney Exchange
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Convergence of the Core in Assignment Markets
- Optimal dynamic matching
- Min-Cost Bipartite Perfect Matching with Delays
- Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities
- On Matching and Thickness in Heterogeneous Dynamic Markets
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Paths, Trees, and Flowers
- Online matching: haste makes waste!
- A dynamic model of barter exchange
- Random Walk and the Theory of Brownian Motion
- On Cumulative Sums of Random Variables
- College Admissions and the Stability of Marriage
- Matching in Dynamic Imbalanced Markets
This page was built for publication: Quick or cheap? Breaking points in dynamic markets