IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v303y2022i2p668-687.html
   My bibliography  Save this article

Primary versus secondary infrastructure capacity allocation mechanisms

Author

Listed:
  • Jacquillat, Alexandre
  • Vaze, Vikrant
  • Wang, Weilong

Abstract

Many infrastructure systems are governed by non-monetary capacity allocation: users submit scheduling requests and an infrastructure manager determines a schedule of utilization given capacity restrictions. Two broad approaches exist to cope with information asymmetry. Under a primary mechanism, the infrastructure manager determines the eventual schedule. Under a secondary mechanism, users can swap their service units following the scheduling adjustments from the infrastructure manager. The secondary mechanism provides flexibility to align the schedule with users’ (private) preferences. However, this paper shows that the secondary mechanism may not result in more efficient outcomes when users are strategic. We develop a multi-stage capacity allocation game in infrastructure systems characterized by multi-period operations, discrete service units and non-atomistic users. We show that the primary mechanism either is incentive compatible, or incentivizes users to voluntarily displace low-value service units from peak to off-peak periods. Such “good gaming” behaviors mitigate system-wide costs. In contrast, the secondary mechanism incentivizes users to request more service units than preferred in peak periods. Such “bad gaming” behaviors increase system-wide costs. The costs from “bad gaming” may outweigh the benefits from secondary swaps: system-wide costs can be lower under the (restricted) primary mechanism than under the (flexible) secondary mechanism.

Suggested Citation

  • Jacquillat, Alexandre & Vaze, Vikrant & Wang, Weilong, 2022. "Primary versus secondary infrastructure capacity allocation mechanisms," European Journal of Operational Research, Elsevier, vol. 303(2), pages 668-687.
  • Handle: RePEc:eee:ejores:v:303:y:2022:i:2:p:668-687
    DOI: 10.1016/j.ejor.2022.03.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722001795
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2022.03.003?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. Ning Chen & Nick Gravin & Pinyan Lu, 2014. "Truthful Generalized Assignments via Stable Matching," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 722-736, August.
    2. Jean-François Cordeau & Gilbert Laporte & Pasquale Legato & Luigi Moccia, 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem," Transportation Science, INFORMS, vol. 39(4), pages 526-538, November.
    3. Guo, Yingni & Hörner, Johannes, 2015. "Dynamic Mechanisms without Money," Economics Series 310, Institute for Advanced Studies.
    4. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
    5. Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
    6. Santiago R. Balseiro & Huseyin Gurkan & Peng Sun, 2019. "Multiagent Mechanism Design Without Money," Operations Research, INFORMS, vol. 67(5), pages 1417-1436, September.
    7. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
    8. R. Borndörfer & M. Grötschel & S. Lukac & K. Mitusch & T. Schlechte & S. Schultz & A. Tanner, 2006. "An Auction Approach to Railway Slot Allocation," Competition and Regulation in Network Industries, Intersentia, vol. 7(2), pages 163-197, June.
    9. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    10. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
    11. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    12. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    13. Jerome Bracken & James T. McGill, 1973. "Mathematical Programs with Optimization Problems in the Constraints," Operations Research, INFORMS, vol. 21(1), pages 37-44, February.
    14. Itai Ashlagi & Peng Shi, 2016. "Optimal Allocation Without Money: An Engineering Approach," Management Science, INFORMS, vol. 62(4), pages 1078-1097, April.
    15. Daron Acemoglu & Asuman Ozdaglar, 2007. "Competition and Efficiency in Congested Markets," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 1-31, February.
    16. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    17. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    18. Partha Dasgupta & Peter Hammond & Eric Maskin, 1979. "The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 46(2), pages 185-216.
    19. Kris Johnson & David Simchi-Levi & Peng Sun, 2014. "Analyzing Scrip Systems," Operations Research, INFORMS, vol. 62(3), pages 524-534, June.
    20. Alexandre Jacquillat & Amedeo R. Odoni, 2015. "An Integrated Scheduling and Operations Approach to Airport Congestion Mitigation," Operations Research, INFORMS, vol. 63(6), pages 1390-1410, December.
    21. Frederic H. Murphy & Yves Smeers, 2005. "Generation Capacity Expansion in Imperfectly Competitive Restructured Electricity Markets," Operations Research, INFORMS, vol. 53(4), pages 646-661, August.
    22. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    23. Pettersen Strandenes, Siri & Wolfstetter, Elmar, 2005. "Efficient (re-)scheduling: An auction approach," Economics Letters, Elsevier, vol. 89(2), pages 187-192, November.
    24. Michael O. Ball & Alexander S. Estes & Mark Hansen & Yulin Liu, 2020. "Quantity-Contingent Auctions and Allocation of Airport Slots," Transportation Science, INFORMS, vol. 54(4), pages 858-881, July.
    25. 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. Maskin, Eric & Sjostrom, Tomas, 2002. "Implementation theory," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 5, pages 237-288 Elsevier.
    2. Bierbrauer, Felix & Netzer, Nick, 2016. "Mechanism design and intentions," Journal of Economic Theory, Elsevier, vol. 163(C), pages 557-603.
    3. Claude d'Aspremont & Jacques Crémer & Louis-André Gérard-Varet, 2003. "Correlation, independence, and Bayesian incentives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 281-310, October.
    4. 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.
    5. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    6. Helmut Bester, 2009. "Externalities, communication and the allocation of decision rights," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 41(2), pages 269-296, November.
    7. Ball, Michael O. & Berardino, Frank & Hansen, Mark, 2018. "The use of auctions for allocating airport access rights," Transportation Research Part A: Policy and Practice, Elsevier, vol. 114(PA), pages 186-202.
    8. Alva, Samson & Manjunath, Vikram, 2019. "Strategy-proof Pareto-improvement," Journal of Economic Theory, Elsevier, vol. 181(C), pages 121-142.
    9. Dilip Mookherjee, 2008. "The 2007 Nobel Memorial Prize in Mechanism Design Theory," Scandinavian Journal of Economics, Wiley Blackwell, vol. 110(2), pages 237-260, June.
    10. Hideki Mizukami & Takuma Wakayama, 2005. "Relationships between Non-Bossiness and Nash Implementability," Discussion Papers in Economics and Business 05-33, Osaka University, Graduate School of Economics.
    11. Corchón, Luis C., 2008. "The theory of implementation : what did we learn?," UC3M Working papers. Economics we081207, Universidad Carlos III de Madrid. Departamento de Economía.
    12. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    13. Mizukami, Hideki & Wakayama, Takuma, 2009. "The relation between non-bossiness and monotonicity," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 256-264, September.
    14. Raghavan, Madhav, 2020. "Influence in private-goods allocation," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 14-28.
    15. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    16. Roberto Serrano, 2003. "The Theory of Implementation of Social Choice Rules," Working Papers 2003-19, Brown University, Department of Economics.
    17. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    18. 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.
    19. Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
    20. Sulin Ba & Jan Stallaert & Andrew B. Whinston, 2001. "Research Commentary: Introducing a Third Dimension in Information Systems Design—The Case for Incentive Alignment," Information Systems Research, INFORMS, vol. 12(3), pages 225-239, September.

    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:ejores:v:303:y:2022:i:2:p:668-687. 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/eor .

    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.