IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2101.05379.html
   My bibliography  Save this paper

Copositive Duality for Discrete Markets and Games

Author

Listed:
  • Cheng Guo
  • Merve Bodur
  • Joshua A. Taylor

Abstract

Optimization problems with discrete decisions are nonconvex and thus lack strong duality, which limits the usefulness of tools such as shadow prices and the KKT conditions. It was shown in Burer(2009) that mixed-binary quadratic programs can be written as completely positive programs, which are convex. Completely positive reformulations of discrete optimization problems therefore have strong duality if a constraint qualification is satisfied. We apply this perspective in two ways. First, we write unit commitment in power systems as a completely positive program, and use the dual copositive program to design a new pricing mechanism. Second, we reformulate integer programming games in terms of completely positive programming, and use the KKT conditions to solve for pure strategy Nash equilibria. To facilitate implementation, we also design a cutting plane algorithm for solving copositive programs exactly.

Suggested Citation

  • Cheng Guo & Merve Bodur & Joshua A. Taylor, 2021. "Copositive Duality for Discrete Markets and Games," Papers 2101.05379, arXiv.org, revised Jan 2021.
    • Handle: RePEc:arx:papers:2101.05379
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2101.05379
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Steven Gabriel & Sauleh Siddiqui & Antonio Conejo & Carlos Ruiz, 2013. "Solving Discretely-Constrained Nash–Cournot Games with an Application to Power Markets," Networks and Spatial Economics, Springer, vol. 13(3), pages 307-326, September.
    2. O'Neill, Richard P. & Sotkiewicz, Paul M. & Hobbs, Benjamin F. & Rothkopf, Michael H. & Stewart, William R., 2005. "Efficient market-clearing prices in markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 164(1), pages 269-285, July.
    3. Matthias Köppe & Christopher Thomas Ryan & Maurice Queyranne, 2011. "Rational Generating Functions and Integer Programming Games," Operations Research, INFORMS, vol. 59(6), pages 1445-1460, December.
    4. Danilov, Vladimir & Koshevoy, Gleb & Murota, Kazuo, 2001. "Discrete convexity and equilibria in economies with indivisible goods and money," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 251-273, May.
    5. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    6. Mallick, Indrajit, 2011. "On the existence of pure strategy Nash equilibria in two person discrete games," Economics Letters, Elsevier, vol. 111(2), pages 144-146, May.
    7. Navid Azizan & Yu Su & Krishnamurthy Dvijotham & Adam Wierman, 2020. "Optimal Pricing in Markets with Nonconvex Costs," Operations Research, INFORMS, vol. 68(2), pages 480-496, March.
    8. David Avis & Gabriel Rosenberg & Rahul Savani & Bernhard Stengel, 2010. "Enumeration of Nash equilibria for two-player games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 9-37, January.
    9. Guanglin Xu & Samuel Burer, 2018. "A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides," Computational Optimization and Applications, Springer, vol. 70(1), pages 33-59, May.
    10. George Liberopoulos & Panagiotis Andrianesis, 2016. "Critical Review of Pricing Schemes in Markets with Non-Convex Costs," Operations Research, INFORMS, vol. 64(1), pages 17-31, 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. Dimitri J. Papageorgiou & Francisco Trespalacios & Stuart Harwood, 2021. "A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity," Networks and Spatial Economics, Springer, vol. 21(2), pages 325-330, June.

    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. Hassan Shavandi & Mehrdad Pirnia & J. David Fuller, 2018. "Extended opportunity cost model to find near equilibrium electricity prices under non-convexities," Papers 1809.09734, arXiv.org.
    2. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    3. Schwarz, Gregor & Bichler, Martin, 2022. "How to trade thirty thousand products: A wholesale market design for road capacity," Transportation Research Part A: Policy and Practice, Elsevier, vol. 164(C), pages 167-185.
    4. Wang, Yi & Yang, Zhifang & Yu, Juan & Liu, Sixu, 2023. "Pricing in non-convex electricity markets with flexible trade-off of pricing properties," Energy, Elsevier, vol. 274(C).
    5. Martin Bichler & Hans Ulrich Buhl & Johannes Knörr & Felipe Maldonado & Paul Schott & Stefan Waldherr & Martin Weibelzahl, 2022. "Electricity Markets in a Time of Change: A Call to Arms for Business Research," Schmalenbach Journal of Business Research, Springer, vol. 74(1), pages 77-102, March.
    6. Shavandi, Hassan & Pirnia, Mehrdad & Fuller, J. David, 2019. "Extended opportunity cost model to find near equilibrium electricity prices under non-convexities," Applied Energy, Elsevier, vol. 240(C), pages 251-264.
    7. Mays, Jacob & Morton, David P. & O’Neill, Richard P., 2021. "Investment effects of pricing schemes for non-convex markets," European Journal of Operational Research, Elsevier, vol. 289(2), pages 712-726.
    8. Gabriele Dragotto & Rosario Scatamacchia, 2023. "The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1143-1160, September.
    9. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    10. Ngoc Mai Tran & Josephine Yu, 2015. "Product-Mix Auctions and Tropical Geometry," Papers 1505.05737, arXiv.org, revised Oct 2017.
    11. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    12. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    13. Navid Azizan & Yu Su & Krishnamurthy Dvijotham & Adam Wierman, 2020. "Optimal Pricing in Markets with Nonconvex Costs," Operations Research, INFORMS, vol. 68(2), pages 480-496, March.
    14. Cheng Lu & Zhibin Deng & Shu-Cherng Fang & Qingwei Jin & Wenxun Xing, 0. "Fast computation of global solutions to the single-period unit commitment problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-26.
    15. Panagiotis Andrianesis & Dimitris Bertsimas & Michael C. Caramanis & William W. Hogan, 2020. "Computation of Convex Hull Prices in Electricity Markets with Non-Convexities using Dantzig-Wolfe Decomposition," Papers 2012.13331, arXiv.org, revised Oct 2021.
    16. Xin Shi & Alberto J. Lamadrid L. & Luis F. Zuluaga, 2021. "Revenue Adequate Prices for Chance-Constrained Electricity Markets with Variable Renewable Energy Sources," Papers 2105.01233, arXiv.org.
    17. Kopiske, Jakob & Spieker, Sebastian & Tsatsaronis, George, 2017. "Value of power plant flexibility in power systems with high shares of variable renewables: A scenario outlook for Germany 2035," Energy, Elsevier, vol. 137(C), pages 823-833.
    18. Vadim Borokhov, 2022. "Utilizing the redundant constraints for the uplift payment elimination," Operational Research, Springer, vol. 22(2), pages 1377-1402, April.
    19. Chao Huang, 2021. "Unidirectional substitutes and complements," Papers 2108.12572, arXiv.org.
    20. Marie-Charlotte Brandenburg & Christian Haase & Ngoc Mai Tran, 2021. "Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes," Papers 2107.08813, arXiv.org, revised Nov 2021.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2101.05379. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.