IDEAS home Printed from https://ideas.repec.org/a/eee/eneeco/v111y2022ics0140988322002481.html
   My bibliography  Save this article

Convex combinatorial auction of pipeline network capacities

Author

Listed:
  • Csercsik, Dávid

Abstract

In this paper we propose a mechanism for the allocation of pipeline capacities, assuming that the participants bidding for capacities do have subjective evaluation of various network routes. The proposed mechanism is based on the concept of bidding for route–quantity pairs. Each participant defines a limited number of routes and places multiple bids, corresponding to various quantities, on each of these routes. The proposed mechanism assigns a convex combination of the submitted bids to each participant, thus its called convex combinatorial auction. The capacity payments in the proposed model are determined according to the Vickrey–Clarke–Groves principle. We compare the efficiency of the proposed algorithm with a simplified model of the method currently used for pipeline capacity allocation in the EU (simultaneous ascending clock auction of pipeline capacities) via simulation, according to various measures, such as resulting and net utility of players, utilization of network capacities, total income of the auctioneer and fairness.

Suggested Citation

  • Csercsik, Dávid, 2022. "Convex combinatorial auction of pipeline network capacities," Energy Economics, Elsevier, vol. 111(C).
    • Handle: RePEc:eee:eneeco:v:111:y:2022:i:c:s0140988322002481
    DOI: 10.1016/j.eneco.2022.106084
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0140988322002481
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.eneco.2022.106084?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. Csercsik, Dávid & Hubert, Franz & Sziklai, Balázs R. & Kóczy, László Á., 2019. "Modeling transfer profits as externalities in a cooperative game-theoretic model of natural gas networks," Energy Economics, Elsevier, vol. 80(C), pages 355-365.
    2. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    3. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    4. Fu-Shiung Hsieh, 2021. "A Comparison of Three Ridesharing Cost Savings Allocation Schemes Based on the Number of Acceptable Shared Rides," Energies, MDPI, vol. 14(21), pages 1-30, October.
    5. Xia, Mu & Stallaert, Jan & Whinston, Andrew B., 2005. "Solving the combinatorial double auction problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 239-251, July.
    6. Bruce Scherr & Emerson Babb, 1975. "Pricing public goods," Public Choice, Springer, vol. 23(1), pages 35-48, September.
    7. Bilgin, Mert, 2009. "Geopolitics of European natural gas demand: Supplies from Russia, Caspian and the Middle East," Energy Policy, Elsevier, vol. 37(11), pages 4482-4492, November.
    8. Keller, Jann T. & Kuper, Gerard H. & Mulder, Machiel, 2019. "Mergers of Germany's natural gas market areas: Is transmission capacity booked efficiently?," Utilities Policy, Elsevier, vol. 56(C), pages 104-119.
    9. Tim Roughgarden & Inbal Talgam-Cohen, 2019. "Approximately Optimal Mechanism Design," Annual Review of Economics, Annual Reviews, vol. 11(1), pages 355-381, August.
    10. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    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. Liao, Qi & Tu, Renfu & Zhang, Wan & Wang, Bohong & Liang, Yongtu & Zhang, Haoran, 2023. "Auction design for capacity allocation in the petroleum pipeline under fair opening," Energy, Elsevier, vol. 264(C).

    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. D'avid Csercsik, 2020. "Convex Combinatorial Auction of Pipeline Network Capacities," Papers 2002.06554, arXiv.org.
    2. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    3. T. Tideman, 1983. "An experiment in the demand-revealing process," Public Choice, Springer, vol. 41(3), pages 387-401, January.
    4. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
    5. Ledyard, John O., "undated". "Public Goods: A Survey of Experimental Research," Working Papers 861, California Institute of Technology, Division of the Humanities and Social Sciences.
    6. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
    7. Ervasti, Valtteri & Leskelä, Riikka-Leena, 2010. "Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support," European Journal of Operational Research, Elsevier, vol. 203(1), pages 251-260, May.
    8. Ravi Bapna & Paulo Goes & Alok Gupta, 2005. "Pricing and Allocation for Quality-Differentiated Online Services," Management Science, INFORMS, vol. 51(7), pages 1141-1150, July.
    9. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    10. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    11. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    12. Schellhorn, Henry, 2009. "A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms," European Journal of Operational Research, Elsevier, vol. 197(2), pages 799-808, September.
    13. G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    14. Elendner, Thomas & Femerling, R., 2003. "Allocation of in-house services: Experimental comparison of allocation mechanisms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 577, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    16. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    17. Heiner Ackermann & Hendrik Ewe & Karl-Heinz Küfer & Michael Schröder, 2014. "Modeling profit sharing in combinatorial exchanges by network flows," Annals of Operations Research, Springer, vol. 222(1), pages 5-28, November.
    18. Tatsuki Homma & Ryosuke Iba & Junyi Shen & Takuma Wakayama & Hirofumi Yamamura & Takehiko Yamato, 2022. "The pivotal mechanism versus the voluntary contribution mechanism: an experimental comparison," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(3), pages 429-505, April.
    19. Andrew Lim & Brian Rodrigues & Zhou Xu, 2008. "Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees," Operations Research, INFORMS, vol. 56(3), pages 758-771, June.
    20. Henry Schellhorn, 2004. "A Double-Sided Multiunit Combinatorial Auction for Substitutes: Theory and Algorithms," FAME Research Paper Series rp123, International Center for Financial Asset Management and Engineering.

    More about this item

    Keywords

    Natural gas networks; Capacity allocation; Modeling; Mechanism design;
    All these keywords.

    JEL classification:

    • C54 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Quantitative Policy Modeling
    • C57 - Mathematical and Quantitative Methods - - Econometric Modeling - - - Econometrics of Games and Auctions
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:eee:eneeco:v:111:y:2022:i:c:s0140988322002481. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eneco .

    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.