Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: http://hdl.handle.net/10419/103683
Autoren: 
Kimms, Alf
Drechsel, Julia
Datum: 
2009
Quellenangabe: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 2 [Year:] 2009 [Issue:] 2 [Pages:] 206-213
Zusammenfassung: 
Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As an example, we discuss lot sizing with uncertain demand to provide an application for interval-valued games and to demonstrate how interval core elements can be computed. Also, we reveal that pitfalls exist if interval core elements are computed in a straightforward manner by considering the interval borders separately.
Schlagwörter: 
cooperative game theory
core
interval-valued games
lot-sizing
mathematical programming
Persistent Identifier der Erstveröffentlichung: 
Dokumentart: 
Article

Datei(en):
Datei
Größe
168.82 kB





Publikationen in EconStor sind urheberrechtlich geschützt.