Abstract
In this paper a new class of relaxed sequencing games is introduced: the class of Step out -- Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order. Providing an upper bound on the values of the coalitions we show that every Step out -- Step in sequencing game has a non-empty core. This upper bound is a sufficient condition for a sequencing game to have a non-empty core. Moreover, this paper provides a polynomial time algorithm to determine the coalitional values of Step out -- Step in sequencing games.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
