Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios

Sreoshi Banerjee

MPRA Paper from University Library of Munich, Germany

Abstract: Sequencing deals with the problem of assigning slots to agents who are waiting for a service. We study sequencing problems as coalition form games defined in optimistic and pessimistic scenarios. Each agent's level of utility is his Shapley value payoff from the corresponding coalition form game. First, we show that while the core of the optimistic game is always empty, the Shapley value of the pessimistic game is an allocation in its core. Second, we impose the "generalized welfare lower bound" (GWLB) that ex-ante guarantees each agent a minimum level of utility. One of many application of GWLB is the "expected costs bound". It guarantees each agent his expected cost when all arrival orders are equally likely. We prove that the Shapley value payoffs (in both optimistic and pessimistic scenarios) satisfy GWLB if and only if it satisfies the expected costs bound (ECB).

Keywords: Sequencing; welfare lower bounds; core; cooperative game; Shapley value (search for similar items in EconPapers)
JEL-codes: C71 C72 D0 D3 D30 D6 D63 (search for similar items in EconPapers)
Date: 2023-09-24
New Economics Papers: this item is included in nep-gth and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/118680/1/MPRA_paper_118680.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:118680

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().