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

Market Design for Dynamic Pricing and Pooling in Capacitated Networks

Author

Listed:
  • Saurabh Amin
  • Patrick Jaillet
  • Haripriya Pulyassary
  • Manxi Wu

Abstract

We study a market mechanism that sets edge prices to incentivize strategic agents to organize trips that efficiently share limited network capacity. This market allows agents to form groups to share trips, make decisions on departure times and route choices, and make payments to cover edge prices and other costs. We develop a new approach to analyze the existence and computation of market equilibrium, building on theories of combinatorial auctions and dynamic network flows. Our approach tackles the challenges in market equilibrium characterization arising from: (a) integer and network constraints on the dynamic flow of trips in sharing limited edge capacity; (b) heterogeneous and private preferences of strategic agents. We provide sufficient conditions on the network topology and agents' preferences that ensure the existence and polynomial-time computation of market equilibrium. We identify a particular market equilibrium that achieves maximum utilities for all agents, and is equivalent to the outcome of the classical Vickery Clark Grove mechanism. Finally, we extend our results to general networks with multiple populations and apply them to compute dynamic tolls for efficient carpooling in San Francisco Bay Area.

Suggested Citation

  • Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Dynamic Pricing and Pooling in Capacitated Networks," Papers 2307.03994, arXiv.org, revised Nov 2023.
    • Handle: RePEc:arx:papers:2307.03994
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    2. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
    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. Kostas Bimpikis & Ozan Candogan & Daniela Saban, 2019. "Spatial Pricing in Ride-Sharing Networks," Operations Research, INFORMS, vol. 67(3), pages 744-769, May.
    5. Milchtaich, Igal, 2006. "Network topology and the efficiency of equilibrium," Games and Economic Behavior, Elsevier, vol. 57(2), pages 321-346, November.
    6. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    7. Ramesh Johari & John N. Tsitsiklis, 2004. "Efficiency Loss in a Network Resource Allocation Game," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 407-435, August.
    8. Cramton, Peter, 1998. "The Efficiency of the FCC Spectrum Auctions," Journal of Law and Economics, University of Chicago Press, vol. 41(2), pages 727-736, October.
    9. Jos A.M. Potters & Anita van Gellekom & Hans Reijnierse, 2002. "Verifying gross substitutability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 20(4), pages 767-776.
    10. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
    11. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    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. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
    3. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
    4. Kumar, Ujjwal & Roy, Souvik, 2024. "Local incentive compatibility on gross substitutes and other non-convex type-spaces," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    5. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    6. Roy, Souvik & Kumar, Ujjwal, 2021. "Local incentive compatibility in non-convex type-spaces," MPRA Paper 110872, University Library of Munich, Germany.
    7. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
    8. Huang, Chao, 2018. "Independence systems in gross-substitute valuations," Economics Letters, Elsevier, vol. 173(C), pages 135-137.
    9. 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.
    10. Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
    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. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
    13. Alfred Galichon & Yu-Wei Hsieh & Maxime Sylvestre, 2023. "Monotone comparative statics for submodular functions, with an application to aggregated deferred acceptance," Papers 2304.12171, arXiv.org, revised Aug 2024.
    14. Yang, Yi-You, 2013. "A classification approach to Walrasian equilibrium with substitutability," MPRA Paper 47945, University Library of Munich, Germany.
    15. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    16. Yang, Yi-You, 2013. "Competitive equilibrium with indivisible objects," MPRA Paper 74662, University Library of Munich, Germany, revised 19 Oct 2016.
    17. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
    18. Hatfield, John William & Immorlica, Nicole & Kominers, Scott Duke, 2012. "Testing substitutability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 639-645.
    19. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    20. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, 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:2307.03994. 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.