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

Optimal auctions for networked markets with externalities

Author

Listed:
  • Benjamin Heymann
  • Alejandro Jofr'e

Abstract

Motivated by the problem of market power in electricity markets, we introduced in previous works a mechanism for simplified markets of two agents with linear cost. In standard procurement auctions, the market power resulting from the quadratic transmission losses allows the producers to bid above their true values, which are their production cost. The mechanism proposed in the previous paper optimally reduces the producers' margin to the society's benefit. In this paper, we extend those results to a more general market made of a finite number of agents with piecewise linear cost functions, which makes the problem more difficult, but simultaneously more realistic. We show that the methodology works for a large class of externalities. We also provide an algorithm to solve the principal allocation problem. Our contribution provides a benchmark to assess the sub-optimality of the mechanisms used in practice.

Suggested Citation

  • Benjamin Heymann & Alejandro Jofr'e, 2019. "Optimal auctions for networked markets with externalities," Papers 1907.10080, arXiv.org.
    • Handle: RePEc:arx:papers:1907.10080
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Edward J. Anderson & Pär Holmberg & Andrew B. Philpott, 2013. "Mixed strategies in discriminatory divisible-good auctions," RAND Journal of Economics, RAND Corporation, vol. 44(1), pages 1-32, March.
    2. Mark Bagnoli & Ted Bergstrom, 2006. "Log-concave probability and its applications," Studies in Economic Theory, in: Charalambos D. Aliprantis & Rosa L. Matzkin & Daniel L. McFadden & James C. Moore & Nicholas C. Yann (ed.), Rationality and Equilibrium, pages 217-241, Springer.
    3. Juan Escobar & Alejandro Jofré, 2010. "Monopolistic competition in electricity networks with resistance losses," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 44(1), pages 101-121, July.
    4. Benjamin Heymann & Alejandro Jofré, 2016. "Mechanism Design and Auctions for Electricity Network," Working Papers hal-01315844, HAL.
    5. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    6. Xinmin Hu & Daniel Ralph, 2007. "Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices," Operations Research, INFORMS, vol. 55(5), pages 809-827, October.
    7. Sundaram,Rangarajan K., 1996. "A First Course in Optimization Theory," Cambridge Books, Cambridge University Press, number 9780521497190, October.
    8. Laffont, Jean-Jacques & Tirole, Jean, 1988. "The Dynamics of Incentive Contracts," Econometrica, Econometric Society, vol. 56(5), pages 1153-1175, September.
    9. repec:cup:cbooks:9781316779309 is not listed on IDEAS
    10. Sundaram,Rangarajan K., 1996. "A First Course in Optimization Theory," Cambridge Books, Cambridge University Press, number 9780521497701, October.
    11. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    12. Roughgarden,Tim, 2016. "Twenty Lectures on Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9781316624791, October.
    13. Cho, In-Koo, 2003. "Competitive Equilibrium in a Radial Network," RAND Journal of Economics, The RAND Corporation, vol. 34(3), pages 438-460, Autumn.
    14. Roughgarden,Tim, 2016. "Twenty Lectures on Algorithmic Game Theory," Cambridge Books, Cambridge University Press, number 9781107172661, October.
    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. Benjamin Heymann & Alejandro Jofré, 2016. "Mechanism design and allocation algorithms for network markets with piece-wise linear costs and externalities," Working Papers hal-01416411, HAL.
    2. Benjamin Heymann & Alejandro Jofré, 2024. "Reverse auctions with transportation and convex costs," Computational Management Science, Springer, vol. 21(1), pages 1-18, June.
    3. Pär Holmberg & Andy Philpott, 2014. "Supply function equilibria in transportation networks," Cambridge Working Papers in Economics 1421, Faculty of Economics, University of Cambridge.
    4. Kong‐Pin Chen & Szu‐Hsien Ho & Chi‐Hsiang Liu & Chien‐Ming Wang, 2017. "The Optimal Listing Strategies In Online Auctions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 58(2), pages 421-437, May.
    5. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    6. Shunta Akiyama & Mitsuaki Obara & Yasushi Kawase, 2022. "Optimal design of lottery with cumulative prospect theory," Papers 2209.00822, arXiv.org.
    7. Awi Federgruen & Min Wang, 2013. "Monotonicity properties of a class of stochastic inventory systems," Annals of Operations Research, Springer, vol. 208(1), pages 155-186, September.
    8. Chaturvedi, Rakesh, 2020. "Fairness and partial coercion in land assembly," Games and Economic Behavior, Elsevier, vol. 120(C), pages 325-335.
    9. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    10. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
    11. Vijay Mohan & Peyman Khezr, 2024. "Blockchains, MEV and the knapsack problem: a primer," Papers 2403.19077, arXiv.org.
    12. JOHNSON, Paul & ROBERT, Jacques, 1999. "Collusion in a Model of Repeated Auctions," Cahiers de recherche 9909, Universite de Montreal, Departement de sciences economiques.
    13. Krzysztof R. Apt & Jan Heering, 2022. "Characterization of incentive compatible single-parameter mechanisms revisited," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 7(1), pages 113-129, December.
    14. Arve, Malin & Zwart, Gijsbert, 2023. "Optimal procurement and investment in new technologies under uncertainty," Journal of Economic Dynamics and Control, Elsevier, vol. 147(C).
    15. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Oct 2024.
    16. Leandro Arozamena & Estelle Cantillon, 2004. "Investment Incentives in Procurement Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 71(1), pages 1-18.
    17. Brett, Craig & Weymark, John A., 2016. "Voting over selfishly optimal nonlinear income tax schedules with a minimum-utility constraint," Journal of Mathematical Economics, Elsevier, vol. 67(C), pages 18-31.
    18. Gonzalez, Stéphane & Rostom, Fatma Zahra, 2022. "Sharing the global outcomes of finite natural resource exploitation: A dynamic coalitional stability perspective," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 1-10.
    19. Vits, Jeroen & Gelders, Ludo & Pintelon, Liliane, 2006. "Production process changes: A dynamic programming approach to manage effective capacity and experience," International Journal of Production Economics, Elsevier, vol. 104(2), pages 473-481, December.
    20. Rasch, Alexander & Wambach, Achim, 2009. "Internal decision-making rules and collusion," Journal of Economic Behavior & Organization, Elsevier, vol. 72(2), pages 703-715, November.

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