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

Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges

Author

Listed:
  • D'avid Csercsik

Abstract

In this paper we study the so-called minimum income condition order, which is used in some day-ahead electricity power exchanges to represent the production-related costs of generating units. This order belongs to the family of complex orders, which imply non-convexities in the market clearing problem. We demonstrate via simple numerical examples that if more of such bids are present in the market, their interplay may open the possibility of strategic bidding. More precisely, we show that by the manipulation of bid parameters, a strategic player may increase its own profit and potentially induce the deactivation of an other minimum income condition order, which would be accepted under truthful bidding. Furthermore, we show that if we modify the objective function used in the market clearing according to principles suggested in the literature, it is possible to prevent the possibility of such strategic bidding, but the modification raises other issues.

Suggested Citation

  • D'avid Csercsik, 2020. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Papers 2012.07789, arXiv.org.
  • Handle: RePEc:arx:papers:2012.07789
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Meeus, Leonardo & Verhaegen, Karolien & Belmans, Ronnie, 2009. "Block order restrictions in combinatorial electric energy auctions," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1202-1206, August.
    2. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    3. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    4. Aliabadi, Danial Esmaeili & Kaya, Murat & Şahin, Güvenç, 2017. "An agent-based simulation of power generation company behavior in electricity markets under different market-clearing mechanisms," Energy Policy, Elsevier, vol. 100(C), pages 191-205.
    5. Richstein, Jörn C. & Lorenz, Casimir & Neuhoff, Karsten, 2020. "An auction story: How simple bids struggle with uncertainty," Energy Economics, Elsevier, vol. 89(C).
    6. Paul Klemperer, 2004. "Survey of Auction Theory, from Auctions: Theory and Practice," Introductory Chapters, in: Auctions: Theory and Practice, Princeton University Press.
    7. Peter Cramton & Yoav Shoham & Richard Steinberg, 2007. "An Overview of Combinatorial Auctions," Papers of Peter Cramton 07oca, University of Maryland, Department of Economics - Peter Cramton, revised 2007.
    8. Koltsaklis, Nikolaos E. & Dagoumas, Athanasios S., 2018. "Incorporating unit commitment aspects to the European electricity markets algorithm: An optimization model for the joint clearing of energy and reserve markets," Applied Energy, Elsevier, vol. 231(C), pages 235-258.
    9. Madani, Mehdi & Van Vyve, Mathieu, 2015. "Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions," European Journal of Operational Research, Elsevier, vol. 242(2), pages 580-593.
    10. Hurwicz, Leonid, 1973. "The Design of Mechanisms for Resource Allocation," American Economic Review, American Economic Association, vol. 63(2), pages 1-30, May.
    11. Garci'a-Bertrand, Raquel & Conejo, Antonio J. & Gabriel, Steven, 2006. "Electricity market near-equilibrium under locational marginal pricing and minimum profit conditions," European Journal of Operational Research, Elsevier, vol. 174(1), pages 457-479, October.
    12. 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).
    13. Bower, John & Bunn, Derek, 2001. "Experimental analysis of the efficiency of uniform-price versus discriminatory auctions in the England and Wales electricity market," Journal of Economic Dynamics and Control, Elsevier, vol. 25(3-4), pages 561-592, March.
    14. Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
    15. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    Full references (including those not matched with items on IDEAS)

    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. Csercsik, Dávid, 2021. "Strategic bidding via the interplay of minimum income condition orders in day-ahead power exchanges," Energy Economics, Elsevier, vol. 95(C).
    2. Mehdi Madani & Mathieu Van Vyve, 2017. "A MIP framework for non-convex uniform price day-ahead electricity auctions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 263-284, March.
    3. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    4. repec:diw:diwwpp:dp1765 is not listed on IDEAS
    5. Richstein, Jörn C. & Lorenz, Casimir & Neuhoff, Karsten, 2020. "An auction story: How simple bids struggle with uncertainty," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 89, pages 1-1.
    6. Sun, Ning & Yang, Zaifu, 2016. "An Efficient and Strategy-Proof Double-Track Auction for Substitutes and Complements," Center for Mathematical Economics Working Papers 523, Center for Mathematical Economics, Bielefeld University.
    7. Axel Ockenfels, 2009. "Marktdesign und Experimentelle Wirtschaftsforschung," Perspektiven der Wirtschaftspolitik, Verein für Socialpolitik, vol. 10(s1), pages 31-53, May.
    8. Madani, M. & Van Vyve, M., 2015. "A MIP framework for non-convex uniform price day-ahead electricity auctions," LIDAM Discussion Papers CORE 2015017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Divényi, Dániel & Polgári, Beáta & Sleisz, Ádám & Sőrés, Péter & Raisz, Dávid, 2021. "Investigating minimum income condition orders on European power exchanges: Controversial properties and enhancement proposals," Applied Energy, Elsevier, vol. 281(C).
    10. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    11. Petr Fiala, 2016. "Supply chain coordination with auctions," Journal of Business Economics, Springer, vol. 86(1), pages 155-171, January.
    12. Paulo Fagandini & Ingemar Dierickx, 2023. "Correction: Computing Profit-Maximizing Bid Shading Factors in First-Price Sealed-Bid Auctions," Computational Economics, Springer;Society for Computational Economics, vol. 61(3), pages 1037-1037, March.
    13. Drabik Ewa, 2013. "Several Remarks on Banach–Mazur Games and its Applications Ewa Drabik," Foundations of Management, Sciendo, vol. 5(1), pages 21-25, June.
    14. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    15. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    16. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    17. Brânzei, R. & Fragnelli, V. & Meca, A. & Tijs, S.H., 2006. "Two Classes of Cooperative Games Related to One-Object Auction Situations," Discussion Paper 2006-25, Tilburg University, Center for Economic Research.
    18. Ganuza, Juan José & Viecens, María Fernanda, 2011. "Deployment of high-speed broadband infrastructures during the economic crisis. The case of Xarxa Oberta," Telecommunications Policy, Elsevier, vol. 35(9), pages 857-870.
    19. Zhen Li & Ching-Chung Kuo, 2013. "Design of discrete Dutch auctions with an uncertain number of bidders," Annals of Operations Research, Springer, vol. 211(1), pages 255-272, December.
    20. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    21. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.

    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:2012.07789. 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.