000 | 03119nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-642-13725-9 | ||
003 | DE-He213 | ||
005 | 20140220084539.0 | ||
007 | cr nn 008mamaa | ||
008 | 100825s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642137259 _9978-3-642-13725-9 |
||
024 | 7 |
_a10.1007/978-3-642-13725-9 _2doi |
|
050 | 4 | _aHB144 | |
072 | 7 |
_aPBUD _2bicssc |
|
072 | 7 |
_aKCH _2bicssc |
|
072 | 7 |
_aBUS069000 _2bisacsh |
|
072 | 7 |
_aMAT011000 _2bisacsh |
|
082 | 0 | 4 |
_a330.0151 _223 |
082 | 0 | 4 |
_a330 _223 |
100 | 1 |
_aDrechsel, Julia. _eauthor. |
|
245 | 1 | 0 |
_aCooperative Lot Sizing Games in Supply Chains _h[electronic resource] / _cby Julia Drechsel. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aXIV, 167p. 20 illus., 10 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Economics and Mathematical Systems, _x0075-8442 ; _v644 |
|
505 | 0 | _aSelected Topics in Cooperative Game Theory -- Algorithmic Game Theory -- Cooperation in Supply Chains -- An Economic Lot Sizing Game -- A Lot Sizing Game with Uncertain Demand -- A Capacitated Lot Sizing Game with Transshipments, Scarce Capacities, and Player-Dependent Cost Coefficients -- A Multilevel Lot Sizing Game with Restricted Cooperation -- Conclusions and Future Research. | |
520 | _aThe presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations. | ||
650 | 0 | _aEconomics. | |
650 | 0 | _aEconomics, Mathematical. | |
650 | 0 | _aOperations research. | |
650 | 1 | 4 | _aEconomics/Management Science. |
650 | 2 | 4 | _aGame Theory/Mathematical Methods. |
650 | 2 | 4 | _aOperation Research/Decision Theory. |
650 | 2 | 4 | _aProduction/Logistics/Supply Chain Management. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642137242 |
830 | 0 |
_aLecture Notes in Economics and Mathematical Systems, _x0075-8442 ; _v644 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-13725-9 |
912 | _aZDB-2-SBE | ||
999 |
_c112328 _d112328 |