Document Actions
Citation and Metadata
Recommended citation
Kimms A, Drechsel J (2009). Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games. BuR - Business Research, Vol. 2, Iss. 2, pp. 206-213, URN: urn:nbn:de:0009-20-21721
Download Citation
Endnote
%0 Journal Article %T Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games %A Kimms, Alf %A Drechsel, Julia %J BuR - Business Research %D 2009 %V 2 %N 2 %@ 1866-8658 %F kimms2009 %X 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. %L 330 %K cooperative game theory %K core %K interval-valued games %K lot-sizing %K mathematical programming %U http://nbn-resolving.de/urn:nbn:de:0009-20-21721 %P 206-213
Bibtex
@Article{kimms2009,
author = "Kimms, Alf
and Drechsel, Julia",
title = "Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games",
journal = "BuR - Business Research",
year = "2009",
volume = "2",
number = "2",
pages = "206--213",
keywords = "cooperative game theory",
keywords = "core",
keywords = "interval-valued games",
keywords = "lot-sizing",
keywords = "mathematical programming",
abstract = "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.",
issn = "1866-8658",
url = "http://nbn-resolving.de/urn:nbn:de:0009-20-21721"
}
RIS
TY - JOUR AU - Kimms, Alf AU - Drechsel, Julia PY - 2009// TI - Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games JO - BuR - Business Research SP - 206 EP - 213 VL - 2 IS - 2 KW - cooperative game theory KW - core KW - interval-valued games KW - lot-sizing KW - mathematical programming N2 - 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. SN - 1866-8658 UR - http://nbn-resolving.de/urn:nbn:de:0009-20-21721 ID - kimms2009 ER -
Wordbib
<?xml version="1.0" encoding="UTF-8"?> <b:Sources SelectedStyle="" xmlns:b="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" xmlns="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" > <b:Source> <b:Tag>kimms2009</b:Tag> <b:SourceType>ArticleInAPeriodical</b:SourceType> <b:Year>2009</b:Year> <b:PeriodicalName>BuR - Business Research</b:PeriodicalName> <b:Volume>2</b:Volume> <b:Issue>2</b:Issue> <b:Pages>206-213</b:Pages> <b:Author> <b:Author><b:NameList> <b:Person><b:Last>Kimms</b:Last><b:First>Alf</b:First></b:Person> <b:Person><b:Last>Drechsel</b:Last><b:First>Julia</b:First></b:Person> </b:NameList></b:Author> </b:Author> <b:Title>Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games</b:Title> <b:Comments>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.</b:Comments> </b:Source> </b:Sources>
ISI
PT Journal AU Kimms, A Drechsel, J TI Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games SO BuR - Business Research PY 2009 BP 206 EP 213 VL 2 IS 2 DE cooperative game theory; core; interval-valued games; lot-sizing; mathematical programming AB 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. ER
Mods
<mods>
<titleInfo>
<title>Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games</title>
</titleInfo>
<name type="personal">
<namePart type="family">Kimms</namePart>
<namePart type="given">Alf</namePart>
</name>
<name type="personal">
<namePart type="family">Drechsel</namePart>
<namePart type="given">Julia</namePart>
</name>
<abstract>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.</abstract>
<subject>
<topic>cooperative game theory</topic>
<topic>core</topic>
<topic>interval-valued games</topic>
<topic>lot-sizing</topic>
<topic>mathematical programming</topic>
</subject>
<classification authority="ddc">330</classification>
<relatedItem type="host">
<genre authority="marcgt">periodical</genre>
<genre>academic journal</genre>
<titleInfo>
<title>BuR - Business Research</title>
</titleInfo>
<part>
<detail type="volume">
<number>2</number>
</detail>
<detail type="issue">
<number>2</number>
</detail>
<date>2009</date>
<extent unit="page">
<start>206</start>
<end>213</end>
</extent>
</part>
</relatedItem>
<identifier type="issn">1866-8658</identifier>
<identifier type="urn">urn:nbn:de:0009-20-21721</identifier>
<identifier type="uri">http://nbn-resolving.de/urn:nbn:de:0009-20-21721</identifier>
<identifier type="citekey">kimms2009</identifier>
</mods>
Full Metadata
| Bibliographic Citation | BuR - Business Research, Vol. 2, Iss. 2, pp. 206-213 |
|---|---|
| Title | Cost Sharing under Uncertainty: An Algorithmic Approach to Cooperative Interval-Valued Games (eng) |
| Author | Alf Kimms, Julia Drechsel |
| Language | eng |
| Abstract | 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. |
| Subject | cooperative game theory, core, interval-valued games, lot-sizing, mathematical programming |
| DDC | 330 |
| Rights | authorcontract |
| URN: | urn:nbn:de:0009-20-21721 |
