IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i4d10.1007_s10878-015-9948-9.html
   My bibliography  Save this article

Serve or skip: the power of rejection in online bottleneck matching

Author

Listed:
  • Barbara M. Anthony

    (Southwestern University)

  • Christine Chung

    (Connecticut College)

Abstract

We consider the online matching problem, where n server-vertices lie in a metric space and n request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the egalitarian bottleneck objective, where the goal is to minimize the maximum distance between any request and its server. It has been shown that while there are effective algorithms for the utilitarian objective (minimizing total cost) in the resource augmentation setting where the offline adversary has half the resources, these are not effective for the egalitarian objective. Thus, we propose a new Serve-or-Skip (SoS) bicriteria analysis model, where the online algorithm may reject or skip up to a specified number of requests, and propose two greedy algorithms: GriNN(t) and $${{\textsc {Grin}}^*(t)}$$ G R I N ∗ ( t ) . We show that the SoS model of resource augmentation analysis can essentially simulate the doubled-server-capacity model, and then examine the performance of GriNN(t) and $${\textsc {Grin}^*(t)}$$ G R I N ∗ ( t ) .

Suggested Citation

  • Barbara M. Anthony & Christine Chung, 2016. "Serve or skip: the power of rejection in online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1232-1253, November.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9948-9
    DOI: 10.1007/s10878-015-9948-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9948-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9948-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
    2. Barbara M. Anthony & Christine Chung, 2014. "Online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 100-114, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Man Xiao & Shu Zhao & Weidong Li & Jinhua Yang, 2023. "Online bottleneck matching on a line," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-17, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    2. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    3. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the solution of a stochastic bottleneck assignment problem and its variations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 389-397, April.
    4. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    5. Niclas Boehmer & Robert Bredereck & Piotr Faliszewski & Andrzej Kaczmarczyk & Rolf Niedermeier, 2020. "Line-Up Elections: Parallel Voting with Shared Candidate Pool," Papers 2007.04960, arXiv.org.
    6. Li, Jianbin & Zheng, Yuting & Dai, Bin & Yu, Jiang, 2020. "Implications of matching and pricing strategies for multiple-delivery-points service in a freight O2O platform," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    7. Man Xiao & Shu Zhao & Weidong Li & Jinhua Yang, 2023. "Online bottleneck matching on a line," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-17, May.
    8. Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
    9. Ekta Jain & Kalpana Dahiya & Anuj Sharma & Vanita Verma, 2019. "An improved algorithm for two stage time minimization assignment problem," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 713-736, February.
    10. David Bergman & Jason Imbrogno, 2017. "Surviving a National Football League Survivor Pool," Operations Research, INFORMS, vol. 65(5), pages 1343-1354, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9948-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.