Non-monetary coordination mechanisms for time slot allocation in warehouse delivery
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2020.03.068
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Eduardo M Azevedo & Eric Budish, 2019.
"Strategy-proofness in the Large,"
The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
- Eduardo M. Azevedo & Eric Budish, 2017. "Strategy-proofness in the Large," NBER Working Papers 23771, National Bureau of Economic Research, Inc.
- Triki, Chefi & Oprea, Simona & Beraldi, Patriza & Crainic, Teodor Gabriel, 2014. "The stochastic bid generation problem in combinatorial transportation auctions," European Journal of Operational Research, Elsevier, vol. 236(3), pages 991-999.
- Paul Karaenke & Martin Bichler & Stefan Minner, 2019. "Coordination Is Hard: Electronic Auction Mechanisms for Increased Efficiency in Transportation Logistics," Management Science, INFORMS, vol. 65(12), pages 5884-5900, December.
- Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
- Jenelius, Erik & Koutsopoulos, Haris N., 2013. "Travel time estimation for urban road networks using low frequency probe vehicle data," Transportation Research Part B: Methodological, Elsevier, vol. 53(C), pages 64-81.
- Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
- Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
- Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
- Robert W. Day & S. Raghavan, 2007. "Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions," Management Science, INFORMS, vol. 53(9), pages 1389-1406, September.
- Chakrabarti, Anindya Sundar & Chakrabarti, Bikas K. & Chatterjee, Arnab & Mitra, Manipushpak, 2009. "The Kolkata Paise Restaurant problem and resource utilization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(12), pages 2420-2426.
- Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
- Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Jörg & Manlove, David & Pettersson, William, 2019. "Mathematical models for stable matching problems with ties and incomplete lists," European Journal of Operational Research, Elsevier, vol. 277(2), pages 426-441.
- Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
- Lu, Wei & Quadrifoglio, Luca, 2019. "Fair cost allocation for ridesharing services – modeling, mathematical programming and an algorithm to find the nucleolus," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 41-55.
- Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
- Jon Kleinberg & Jens Ludwig & Sendhil Mullainathan & Ashesh Rambachan, 2018. "Algorithmic Fairness," AEA Papers and Proceedings, American Economic Association, vol. 108, pages 22-27, May.
- Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
- AgralI, Semra & Tan, BarIs & Karaesmen, Fikri, 2008. "Modeling and analysis of an auction-based logistics market," European Journal of Operational Research, Elsevier, vol. 191(1), pages 272-294, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Aziz, Haris & Huang, Xin & Mattei, Nicholas & Segal-Halevi, Erel, 2023. "Computing welfare-Maximizing fair allocations of indivisible goods," European Journal of Operational Research, Elsevier, vol. 307(2), pages 773-784.
- Maria Giuffrida & Riccardo Mangiaracina & Umar Burki, 2021. "Cloud-Based Booking Platforms in Warehouse Operations," Sustainability, MDPI, vol. 13(20), pages 1-16, October.
- Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
- Martin Bichler & Alexander Hammerl & Thayer Morrill & Stefan Waldherr, 2021. "How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair," Information Systems Research, INFORMS, vol. 32(2), pages 335-355, June.
- Kevin Riehl & Anastasios Kouvelas & Michail Makridis, 2024. "Fair Money -- Public Good Value Pricing With Karma Economies," Papers 2407.05132, arXiv.org.
- Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.
- Gabriel Fedorko & Vieroslav Molnár & Nikoleta Mikušová, 2020. "The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics," Sustainability, MDPI, vol. 12(23), pages 1-17, November.
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.- Daniel Kornbluth & Alexey Kushnir, 2024. "Undergraduate Course Allocation through Competitive Markets," Papers 2412.05691, arXiv.org.
- Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.
- Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
- Miralles, Antonio & Pycia, Marek, 2021.
"Foundations of pseudomarkets: Walrasian equilibria for discrete resources,"
Journal of Economic Theory, Elsevier, vol. 196(C).
- Pycia, Marek & Miralles, Antonio, 2020. "Foundations of Pseudomarkets: Walrasian Equilibria for Discrete Resources," CEPR Discussion Papers 15161, C.E.P.R. Discussion Papers.
- Antonio Miralles & Marek Pycia, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," ECON - Working Papers 385, Department of Economics - University of Zurich.
- Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
- Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
- Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.
- Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
- Briand, Martin & Franklin, Rod & Lafkihi, Mariam, 2022. "A dynamic routing protocol with payments for the Physical Internet: A simulation with learning agents," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
- Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
- Eirinakis, Pavlos & Mourtos, Ioannis & Zampou, Eleni, 2022. "Random Serial Dictatorship for horizontal collaboration in logistics," Omega, Elsevier, vol. 111(C).
- Liang, Renchao & Wang, Junwei & Huang, Min & Jiang, Zhong-Zhong, 2020. "Truthful auctions for e-market logistics services procurement with quantity discounts," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 165-180.
- Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2015. "Demand clustering in freight logistics networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 36-51.
- Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
- Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
- Su Xiu Xu & George Q. Huang & Meng Cheng, 2017. "Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration," Transportation Science, INFORMS, vol. 51(4), pages 1365-1386, November.
- Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017.
"An invitation to market design,"
Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
- Scott Kominers & Alexander Teytelboym & Vincent Crawford, 2017. "An Invitation to Market Design," Working Papers 2017-069, Human Capital and Economic Opportunity Working Group.
- Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
- Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014.
"School choice with controlled choice constraints: Hard bounds versus soft bounds,"
Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
- Lars Ehlers & Isa Hafalir & Bumin Yenmez & Muhammed Yildirim, 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," GSIA Working Papers 2012-E20, Carnegie Mellon University, Tepper School of Business.
- Lars Ehlers & Isa Hafalir & Bumin Yenmez & Muhammed Yildirim, 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," GSIA Working Papers 2012-E21, Carnegie Mellon University, Tepper School of Business.
- EHLERS, Lars & HAFALIR, Isa E. & YENMEZ, M. Bumin & YILDIRIM, Muhammed A., 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," Cahiers de recherche 2011-08, Universite de Montreal, Departement de sciences economiques.
- Lars Ehlers & Isa E. Hafalir & M. Bumin Yenmez & Muhammed A. Yildirim, 2011. "School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds," Cahiers de recherche 13-2011, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Julien Combe & Vladyslav Nora & Olivier Tercieux, 2021. "Dynamic assignment without money: Optimality of spot mechanisms," Working Papers 2021-11, Center for Research in Economics and Statistics.
- Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
More about this item
Keywords
Transportation; Electronic markets and matching; Coordination;All these keywords.
Statistics
Access and download statisticsCorrections
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:286:y:2020:i:3:p:897-907. 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.