| Extent: | Online-Ressource (ix, 272 p) 24 cm |
|---|---|
| Series: | |
| Type of publication: | Book / Working Paper |
| Language: | English |
| Notes: | Includes bibliographical references (p. [263]-268) and index Cover; Title; Copyright; Dedication; Contents; Preface; Chapter 1 - Introduction; Chapter 2 - Lattices, Supermodular Functions, and Related Topics; 2.1 Introduction; 2.2 Partially Ordered Sets and Lattices; 2.2.1 Definitions, Notation, and Some Basic Properties; 2.2.2 Sublattice Structure; 2.3 Completeness and Topological Properties; 2.4 Induced Set Ordering; 2.5 Fixed Points; 2.6 Supermodular Functions on a Lattice; 2.6.1 Characterization and Complementarity; 2.6.2 Transformations; 2.6.3 Ordinal Generalizations; 2.6.4 Log-Supermodularity; 2.7 Maximizing a Supermodular Function 2.7.1 Sets of Maximizers2.7.2 Preservation of Supermodularity; 2.8 Increasing Optimal Solutions; 2.8.1 Sufficient Conditions; 2.8.2 Necessary Conditions; 2.9 Complementarity Equivalences; Chapter 3 - Optimal Decision Models; 3.1 Introduction; 3.2 Matching; 3.3 Comparative Statics of the Firm; 3.3.1 Model of the Firm; 3.3.2 Sufficient Conditions; 3.3.3 Necessary Conditions; 3.4 Transportation and Transshipment Problems; 3.4.1 Transportation Problem; 3.4.2 Transshipment Problem; 3.5 Dynamic Economic Lot Size Production Models, Acyclic Networks; 3.5.1 Acyclic Networks 3.5.2 Dynamic Economic Lot Size Production Models3.6 Production Planning; 3.7 Minimum Cuts, Maximum Closures, and the Selection Problem; 3.7.1 Minimum Cut Problem; 3.7.2 Maximum Closure Problem; 3.7.3 Selection Problem; 3.7.4 Equivalent Combinatorial Structures; 3.8 Myopic Decisions; 3.8.1 General Conditions; 3.8.2 Dynamic Selection Problem; 3.9 Markov Decision Processes and Property-Inducing Stochastic Transformations; 3.9.1 Property-Inducing Stochastic Transformations; 3.9.2 Markov Decision Processes 3.10 Stochastic Inventory Problems and Supermodularity-Preserving Stochastic Transformations3.10.1 Supermodularity-Preserving Stochastic Transformations; 3.10.2 Stochastic Inventory Problems; Chapter 4 - Noncooperative Games; 4.1 Introduction; 4.2 Existence of an Equilibrium Point, Parametric Properties; 4.3 Algorithms for Approximating an Equilibrium Point; 4.3.1 Round-Robin Optimization; 4.3.2 Simultaneous Optimization; 4.4 Examples of Supermodular Games; 4.4.1 Pricing Game with Substitute Products; 4.4.2 Production Game with Complementary Products; 4.4.3 Multimarket Oligopoly 4.4.4 Arms Race Game4.4.5 Trading Partner Search Game; 4.4.6 Optimal Consumption Game with Multiple Products; 4.4.7 Facility Location Game; 4.4.8 Minimum Cut Game; Chapter 5 - Cooperative Games; 5.1 Introduction; 5.2 Convex Games; 5.2.1 The Core and the Greedy Algorithm; 5.2.2 Games with a Parameter; 5.2.3 Structure of the Core; 5.3 Examples of Convex Games; 5.3.1 Monopoly Firm; 5.3.2 Monotonic Surplus Sharing; 5.3.3 Aircraft Landing Fee Game; 5.3.4 Trading Game; 5.4 Activity Optimization Games; 5.5 Examples of Activity Optimization Games; 5.5.1 General Welfare Game 5.5.2 Production Game with Common Procurement of Inputs Electronic reproduction; Available via World Wide Web |
| ISBN: | 0-691-03244-0 ; 978-0-691-03244-3 ; 978-0-691-03244-3 |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012672680