IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-24907-5_42.html
   My bibliography  Save this book chapter

Considering Short and Long Term Fairness in Recurrent Auctions with an Application to Collaborative Rostering

In: Operations Research Proceedings 2022

Author

Listed:
  • T. Heller

    (Fraunhofer Institute for Industrial Mathematics ITWM)

  • S. Velten

    (Fraunhofer Institute for Industrial Mathematics ITWM)

Abstract

Collaborative duty rostering can increase the satisfaction of employees in healthcare. For the acceptance of a final rostering, a fair selection of included wishes is essential. As in rostering problems various constraints must be respected, it is generally not possible to accept all bids (wishes for a single free time slot) in a planning period and fairness is important. In this paper we present a weighted Vickrey-Clarke-Groves (VCG) mechanism approach where past auction results are incorporated by a fairness factor and where the underlying winner determination problem is given by a hitting set problem (HSP). We present numerical results of simulation runs over several planning periods.

Suggested Citation

  • T. Heller & S. Velten, 2023. "Considering Short and Long Term Fairness in Recurrent Auctions with an Application to Collaborative Rostering," Lecture Notes in Operations Research, in: Oliver Grothe & Stefan Nickel & Steffen Rebennack & Oliver Stein (ed.), Operations Research Proceedings 2022, chapter 0, pages 349-355, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-24907-5_42
    DOI: 10.1007/978-3-031-24907-5_42
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:lnopch:978-3-031-24907-5_42. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.