Library Services | Technical University of Kenya

Your cart is empty.
Normal view MARC view ISBD view

Cooperative Lot Sizing Games in Supply Chains [electronic resource] / by Julia Drechsel.

By: Drechsel, Julia [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Economics and Mathematical Systems: 644Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Description: XIV, 167p. 20 illus., 10 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642137259.Subject(s): Economics | Economics, Mathematical | Operations research | Economics/Management Science | Game Theory/Mathematical Methods | Operation Research/Decision Theory | Production/Logistics/Supply Chain ManagementDDC classification: 330.0151 | 330 Online resources: Click here to access online
Contents:
Selected 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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Selected 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.

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.

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue