FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2132506336> ?p ?o ?g. }

• W2132506336 endingPage "523" @default.
• W2132506336 startingPage "479" @default.
• W2132506336 abstract "Open AccessOpen Access licenseAboutSectionsView PDF ToolsAdd to favoritesDownload CitationsTrack Citations ShareShare onFacebookTwitterLinked InEmail Go to SectionOpen AccessOpen Access license HomeStochastic SystemsVol. 4, No. 2 On the Dynamic Control of Matching QueuesItai Gurvich, Amy WardItai Gurvich, Amy WardPublished Online:21 Oct 2014https://doi.org/10.1287/13-SSY097AbstractWe consider the optimal control of matching queues with random arrivals. In this model, items arrive to dedicated queues, and wait to be matched with items from other (possibly multiple) queues. A match type corresponds to the set of item classes required for a match. Once a decision has been made to perform a match, the matching itself is instantaneous and the matched items depart from the system. We consider the problem of minimizing finite-horizon cumulative holding costs. The controller must decide which matchings to execute given multiple options. In principle, the controller may choose to wait until some “inventory” of items builds up to facilitate more profitable matches in the future.We introduce a multi-dimensional imbalance process, that at each time t, is given by a linear function of the cumulative arrivals to each of the item classes. A non-zero value of the imbalance at time t means that no control could have matched all the items that arrived by time t. A lower bound based on the imbalance process can be specified, at each time point, by a solution to an optimization problem with linear constraints. While not achievable in general, this lower bound can be asymptotically approached under a dedicated item condition (an analogue of the local traffic condition in bandwidth sharing networks). We devise a myopic discrete-review matching control that asymptotically–as the arrival rates become large–achieves the imbalance-based lower bound. Previous Back to Top Next FiguresReferencesRelatedInformationCited byDynamic Matching: Characterizing and Achieving Constant RegretSüleyman Kerimov, Itai Ashlagi, Itai Gurvich7 June 2023 | Management Science, Vol. 0, No. 0If You Love Your Agents, Set Them Free: Task Discretion in Online WorkplacesVasiliki Kostami5 May 2023 | Management Science, Vol. 0, No. 0Online Assortment Optimization for Two-Sided Matching PlatformsAli Aouad, Daniela Saban27 October 2022 | Management Science, Vol. 69, No. 4Generalized Max-Weight Policies in Stochastic MatchingMatthieu Jonckheere, Pascal Moyal, Claudia Ramírez, Nahuel Soprano-Loto1 August 2022 | Stochastic Systems, Vol. 13, No. 1Courteous or Crude? Managing User Conduct to Improve On-Demand Service Platform PerformanceYunke Mai, Bin Hu, Saša Pekeč25 March 2022 | Management Science, Vol. 69, No. 2Dynamic Pricing and Matching for Two-Sided QueuesSushil Mahavir Varma, Pornpawee Bumpensanti, Siva Theja Maguluri, He Wang8 February 2022 | Operations Research, Vol. 71, No. 1On-Demand Ride-Matching in a Spatial Model with Abandonment and CancellationGuangju Wang, Hailun Zhang, Jiheng Zhang18 November 2022 | Operations Research, Vol. 0, No. 0Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General UtilitiesJose H. Blanchet, Martin I. Reiman, Virag Shah, Lawrence M. Wein, Linjia Wu21 January 2022 | Operations Research, Vol. 70, No. 6Dynamic Stochastic Matching Under Limited TimeAli Aouad, Ömer Sarıtaç6 June 2022 | Operations Research, Vol. 70, No. 4Dynamic Type MatchingMing Hu, Yun Zhou18 March 2021 | Manufacturing & Service Operations Management, Vol. 24, No. 1On the Optimal Design of a Bipartite Matching Queueing SystemPhilipp Afèche, René Caldentey, Varun Gupta5 February 2021 | Operations Research, Vol. 70, No. 1Facilitating the Search for Partners on Matching PlatformsYash Kanoria, Daniela Saban19 May 2021 | Management Science, Vol. 67, No. 10Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book MarketsCostis Maglaras, Ciamac C. Moallemi, Hua Zheng14 June 2021 | Operations Research, Vol. 69, No. 4A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent RewardsYichuan Ding, S. Thomas McCormick, Mahesh Nagarajan16 February 2021 | Operations Research, Vol. 69, No. 4Optimal Control of a Time-Varying Double-Ended Production Queueing ModelChihoon Lee, Xin Liu, Yunan Liu, Ling Zhang9 February 2021 | Stochastic Systems, Vol. 11, No. 2Managing Congestion in Matching MarketsNick Arnosti, Ramesh Johari, Yash Kanoria19 January 2021 | Manufacturing & Service Operations Management, Vol. 23, No. 3Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective ControlsYuqian Xu, Lingjiong Zhu, Michael Pinedo24 July 2020 | Operations Research, Vol. 68, No. 6Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing NetworksAmarjit Budhiraja, Dane Johnson15 April 2020 | Mathematics of Operations Research, Vol. 45, No. 3Pricing and Matching with Forward-Looking Buyers and SellersYiwei Chen, Ming Hu7 August 2019 | Manufacturing & Service Operations Management, Vol. 22, No. 4Design of Lotteries and Wait-Lists for Affordable Housing AllocationNick Arnosti, Peng Shi13 February 2020 | Management Science, Vol. 66, No. 6Dynamic Matching for Real-Time Ride SharingErhun Özkan, Amy R. Ward25 February 2020 | Stochastic Systems, Vol. 10, No. 1On Matching and Thickness in Heterogeneous Dynamic MarketsItai Ashlagi, Maximilien Burq, Patrick Jaillet, Vahideh Manshadi27 June 2019 | Operations Research, Vol. 67, No. 4On the Control of Fork-Join NetworksErhun Özkan, Amy R. Ward31 January 2019 | Mathematics of Operations Research, Vol. 44, No. 2Efficient Dynamic Barter ExchangeRoss Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria14 September 2017 | Operations Research, Vol. 65, No. 6 Volume 4, Issue 2December 2014Pages 321-603 Article Information Supplemental Materials Metrics Information Received:January 01, 2013Published Online:October 21, 2014 Copyright © 2014, The author(s)Cite asItai Gurvich, Amy Ward (2014) On the Dynamic Control of Matching Queues. Stochastic Systems 4(2):479-523. https://doi.org/10.1287/13-SSY097 KeywordsMatching queuesoptimal controldiffusion approximationsPDF download" @default.
• W2132506336 created "2016-06-24" @default.
• W2132506336 creator A5030941135 @default.
• W2132506336 creator A5045807357 @default.
• W2132506336 date "2014-01-01" @default.
• W2132506336 modified "2023-09-24" @default.
• W2132506336 title "On the dynamic control of matching queues" @default.
• W2132506336 cites W1506936706 @default.
• W2132506336 cites W1545370368 @default.
• W2132506336 cites W1589574557 @default.
• W2132506336 cites W1591180426 @default.
• W2132506336 cites W1601741115 @default.
• W2132506336 cites W1968968697 @default.
• W2132506336 cites W1972400284 @default.
• W2132506336 cites W1974518363 @default.
• W2132506336 cites W1986286877 @default.
• W2132506336 cites W1999102639 @default.
• W2132506336 cites W2028076825 @default.
• W2132506336 cites W2088809818 @default.
• W2132506336 cites W2091125010 @default.
• W2132506336 cites W2097287227 @default.
• W2132506336 cites W2100324612 @default.
• W2132506336 cites W2103098926 @default.
• W2132506336 cites W2104307727 @default.
• W2132506336 cites W2105177639 @default.
• W2132506336 cites W2115660254 @default.
• W2132506336 cites W2131769071 @default.
• W2132506336 cites W2135663206 @default.
• W2132506336 cites W2141404848 @default.
• W2132506336 cites W2155770202 @default.
• W2132506336 cites W2159617688 @default.
• W2132506336 cites W2160760078 @default.
• W2132506336 cites W2213674941 @default.
• W2132506336 cites W2318493394 @default.
• W2132506336 cites W2952305724 @default.
• W2132506336 cites W3103538498 @default.
• W2132506336 cites W3121663994 @default.
• W2132506336 cites W3122360041 @default.
• W2132506336 cites W3124309159 @default.
• W2132506336 cites W2320825517 @default.
• W2132506336 doi "https://doi.org/10.1214/13-ssy097" @default.
• W2132506336 hasPublicationYear "2014" @default.
• W2132506336 type Work @default.
• W2132506336 sameAs 2132506336 @default.
• W2132506336 citedByCount "38" @default.
• W2132506336 countsByYear W21325063362013 @default.
• W2132506336 countsByYear W21325063362014 @default.
• W2132506336 countsByYear W21325063362015 @default.
• W2132506336 countsByYear W21325063362016 @default.
• W2132506336 countsByYear W21325063362017 @default.
• W2132506336 countsByYear W21325063362018 @default.
• W2132506336 countsByYear W21325063362019 @default.
• W2132506336 countsByYear W21325063362020 @default.
• W2132506336 countsByYear W21325063362021 @default.
• W2132506336 crossrefType "journal-article" @default.
• W2132506336 hasAuthorship W2132506336A5030941135 @default.
• W2132506336 hasAuthorship W2132506336A5045807357 @default.
• W2132506336 hasBestOaLocation W21325063361 @default.
• W2132506336 hasConcept C105795698 @default.
• W2132506336 hasConcept C106189395 @default.
• W2132506336 hasConcept C126255220 @default.
• W2132506336 hasConcept C134306372 @default.
• W2132506336 hasConcept C14036430 @default.
• W2132506336 hasConcept C159886148 @default.
• W2132506336 hasConcept C160403385 @default.
• W2132506336 hasConcept C165064840 @default.
• W2132506336 hasConcept C177264268 @default.
• W2132506336 hasConcept C199360897 @default.
• W2132506336 hasConcept C203479927 @default.
• W2132506336 hasConcept C33923547 @default.
• W2132506336 hasConcept C41008148 @default.
• W2132506336 hasConcept C6557445 @default.
• W2132506336 hasConcept C77553402 @default.
• W2132506336 hasConcept C78458016 @default.
• W2132506336 hasConcept C86803240 @default.
• W2132506336 hasConceptScore W2132506336C105795698 @default.
• W2132506336 hasConceptScore W2132506336C106189395 @default.
• W2132506336 hasConceptScore W2132506336C126255220 @default.
• W2132506336 hasConceptScore W2132506336C134306372 @default.
• W2132506336 hasConceptScore W2132506336C14036430 @default.
• W2132506336 hasConceptScore W2132506336C159886148 @default.
• W2132506336 hasConceptScore W2132506336C160403385 @default.
• W2132506336 hasConceptScore W2132506336C165064840 @default.
• W2132506336 hasConceptScore W2132506336C177264268 @default.
• W2132506336 hasConceptScore W2132506336C199360897 @default.
• W2132506336 hasConceptScore W2132506336C203479927 @default.
• W2132506336 hasConceptScore W2132506336C33923547 @default.
• W2132506336 hasConceptScore W2132506336C41008148 @default.
• W2132506336 hasConceptScore W2132506336C6557445 @default.
• W2132506336 hasConceptScore W2132506336C77553402 @default.
• W2132506336 hasConceptScore W2132506336C78458016 @default.
• W2132506336 hasConceptScore W2132506336C86803240 @default.
• W2132506336 hasIssue "2" @default.
• W2132506336 hasLocation W21325063361 @default.
• W2132506336 hasLocation W21325063362 @default.
• W2132506336 hasOpenAccess W2132506336 @default.
• W2132506336 hasPrimaryLocation W21325063361 @default.
• W2132506336 hasRelatedWork W1506128430 @default.

• next