Processing Games with Shared Interest

A generalization of processing problems with restricted capacities is introduced.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.The new aspect is that players have interest in all jobs. The corresponding cooperative game of this generalization is proved to be totally balanced.

MoreLess

Year of publication:	2004
Authors:	Quant, Marieke ; Reijnierse, Hans ; Meertens, M.
Institutions:	Tilburg University, Center for Economic Research
Subject:	Processing games \| scheduling \| core allocation

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2004-126
Classification:	C71 - Cooperative Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011090702