On the number of blocks required to access the coalition structure core
Sylvain Béal, Éric Rémila, Philippe Solal
Abstract
Open-access reader
Sylvain Béal, Éric Rémila, Philippe Solal
Abstract
Open-access reader
This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).
Key concepts: Core (optical fiber), Stochastic game, Cardinality (data modeling), Transferable utility, Set (abstract data type), Upper and lower bounds, Mathematics, Mathematical economics