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

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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