| 書目名稱 | Cooperative Lot Sizing Games in Supply Chains |
| 編輯 | Julia Drechsel |
| 視頻video | http://file.papertrans.cn/238/237994/237994.mp4 |
| 概述 | Provides a general solution method to compute cost allocations which is applicable to non-concave and non-monotone operations research games, too.Includes a broad discussion of the core, its numerous |
| 叢書名稱 | Lecture Notes in Economics and Mathematical Systems |
| 圖書封面 |  |
| 描述 | The 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. |
| 出版日期 | Book 2010 |
| 關(guān)鍵詞 | Algorithmic Game Theory; Cooperative Game Theory; Core; Lot Size Optimization; Operations Research Games |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-13725-9 |
| isbn_softcover | 978-3-642-13724-2 |
| isbn_ebook | 978-3-642-13725-9Series ISSN 0075-8442 Series E-ISSN 2196-9957 |
| issn_series | 0075-8442 |
| copyright | Springer-Verlag Berlin Heidelberg 2010 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 20:33
發(fā)表于 2025-3-21 18:04:13
