IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v11y2021i3d10.1007_s13235-020-00375-8.html
   My bibliography  Save this article

Dynamic Coordination Games with Activation Costs

Author

Listed:
  • Stefanny Ramirez

    (University of Groningen)

  • Dario Bauso

    (University of Groningen
    Università di Palermo)

Abstract

Motivated by inventory control problems with set-up costs, we consider a coordination game where each player’s dynamics is an inventory model characterized by a controlled input and an uncontrolled output. An activation cost is shared among active players, namely players who control their dynamics at a given time. At each time, each player decides to be active or not depending on its inventory level. The main contribution of this paper is to show that strategies at a Nash equilibrium have a threshold structure on the number of active players. Furthermore, we provide an explicit expression for the lower and upper threshold is given both in the deterministic case, namely when the exogenous signal is known, and in the single-stage game. The relevance of the above results is discussed in the context of inventory control where Nash equilibrium reordering strategies imply that a single retailer reorders only if jointly with a number of other retailers and will reorder to restore a pre-assigned inventory level.

Suggested Citation

  • Stefanny Ramirez & Dario Bauso, 2021. "Dynamic Coordination Games with Activation Costs," Dynamic Games and Applications, Springer, vol. 11(3), pages 580-596, September.
  • Handle: RePEc:spr:dyngam:v:11:y:2021:i:3:d:10.1007_s13235-020-00375-8
    DOI: 10.1007/s13235-020-00375-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-020-00375-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13235-020-00375-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. Federgruen & H. Groenevelt & H. C. Tijms, 1984. "Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands," Management Science, INFORMS, vol. 30(3), pages 344-357, March.
    2. Rommert Dekker & Ralph Wildeman & Frank Duyn Schouten, 1997. "A review of multi-component maintenance models with economic dependence," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(3), pages 411-435, October.
    3. Dario Bauso & Quanyan Zhu & Tamer Başar, 2016. "Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 606-630, May.
    4. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, April.
    5. POCHET, Yves & WOLSEY, Laurence A., 1993. "Lot-sizing with constant batches: formulation and valid inequalities," LIDAM Reprints CORE 1066, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Andrew J. Clark & Herbert Scarf, 2004. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 50(12_supple), pages 1782-1790, December.
    7. Yves Pochet & Laurence A. Wolsey, 1993. "Lot-Sizing with Constant Batches: Formulation and Valid Inequalities," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 767-785, November.
    8. Bauso, Dario & Giarré, Laura & Pesenti, Raffaele, 2009. "Distributed consensus in noncooperative inventory games," European Journal of Operational Research, Elsevier, vol. 192(3), pages 866-878, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stefanny Ramirez & Dario Bauso, 2023. "Dynamic Games with Strategic Complements and Large Number of Players," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 1-21, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. BELVAUX, Gaetan & WOLSEY, Laurence A., 2000. "Modelling practical lot-sizing problems as mixed integer programs," LIDAM Discussion Papers CORE 2000009, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    3. Dario Bauso & Quanyan Zhu & Tamer Başar, 2016. "Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 606-630, May.
    4. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    5. Stefanny Ramirez & Dario Bauso, 2023. "Dynamic Games with Strategic Complements and Large Number of Players," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 1-21, April.
    6. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    7. Archibald, Thomas W. & Bokkers, Menno B. & Dekker, Rommert & Vliet, Andre van, 1999. "Minimising bins in transmission systems," European Journal of Operational Research, Elsevier, vol. 115(2), pages 380-391, June.
    8. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    9. Zhicheng Zhu & Yisha Xiang & Bo Zeng, 2021. "Multicomponent Maintenance Optimization: A Stochastic Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 898-914, July.
    10. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    11. van Hoesel, C.P.M. & Wagelmans, A., 1997. "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Research Memorandum 029, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    12. Miguel Constantino, 1998. "Lower Bounds in Lot-Sizing Models: A Polyhedral Study," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 101-118, February.
    13. Osman Alp & Nesim K. Erkip & Refik Güllü, 2003. "Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs," Operations Research, INFORMS, vol. 51(1), pages 160-166, February.
    14. Akbalik, Ayse & Penz, Bernard, 2009. "Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs," International Journal of Production Economics, Elsevier, vol. 119(2), pages 367-379, June.
    15. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    16. VAN VYVE, Mathieu, 2011. "Linear prices for non-convex electricity markets: models and algorithms," LIDAM Discussion Papers CORE 2011050, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. STEPHAN, Rüdiger, 2010. "An extension of disjunctive programming and its impact for compact tree formulations," LIDAM Discussion Papers CORE 2010045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    19. Miller, Andrew J. & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra," European Journal of Operational Research, Elsevier, vol. 125(2), pages 298-315, September.
    20. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.

    More about this item

    Keywords

    Dynamic games; Inventory control;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:dyngam:v:11:y:2021:i:3:d:10.1007_s13235-020-00375-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.