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:	2005
Authors:	Quant, Marieke ; Meertens, Marc ; Reijnierse, Hans
Publisher:	[S.l.] : SSRN
Subject:	Spieltheorie \| Game theory \| Kooperatives Spiel \| Cooperative game \| Scheduling-Verfahren \| Scheduling problem \| Operations Research \| Operations research

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (10 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments November 2004 erstellt
Other identifiers:	10.2139/ssrn.642421 [DOI]
Classification:	C71 - Cooperative Games
Source:	ECONIS - Online Catalogue of the ZBW

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