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

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.