IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i14p3240-d1200822.html
   My bibliography  Save this article

Optimal Multi-Attribute Auctions Based on Multi-Scale Loss Network

Author

Listed:
  • Zefeng Zhao

    (Faculty of Data Science, City University of Macau, Macau 999078, China)

  • Haohao Cai

    (Faculty of Data Science, City University of Macau, Macau 999078, China)

  • Huawei Ma

    (Institute of AI and Blockchain, Guangzhou University, Guangzhou 510006, China)

  • Shujie Zou

    (Faculty of Data Science, City University of Macau, Macau 999078, China)

  • Chiawei Chu

    (Faculty of Data Science, City University of Macau, Macau 999078, China)

Abstract

There is a strong demand for multi-attribute auctions in real-world scenarios for non-price attributes that allow participants to express their preferences and the item’s value. However, this also makes it difficult to perform calculations with incomplete information, as a single attribute—price—no longer determines the revenue. At the same time, the mechanism must satisfy individual rationality (IR) and incentive compatibility (IC). This paper proposes an innovative dual network to solve these problems. A shared MLP module is constructed to extract bidder features, and multiple-scale loss is used to determine network status and update. The method was tested on real and extended cases, showing that the approach effectively improves the auctioneer’s revenue without compromising the bidder.

Suggested Citation

  • Zefeng Zhao & Haohao Cai & Huawei Ma & Shujie Zou & Chiawei Chu, 2023. "Optimal Multi-Attribute Auctions Based on Multi-Scale Loss Network," Mathematics, MDPI, vol. 11(14), pages 1-11, July.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:14:p:3240-:d:1200822
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/14/3240/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/14/3240/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alok Gupta & Stephen Parente & Pallab Sanyal, 2012. "Competitive bidding for health insurance contracts: lessons from the online HMO auctions," International Journal of Health Economics and Management, Springer, vol. 12(4), pages 303-322, December.
    2. Pham, Long & Teich, Jeffrey & Wallenius, Hannele & Wallenius, Jyrki, 2015. "Multi-attribute online reverse auctions: Recent research trends," European Journal of Operational Research, Elsevier, vol. 242(1), pages 1-9.
    3. Zhang, Juliang & Xiang, Jie & Cheng, T.C. Edwin & Hua, Guowei & Chen, Cheng, 2019. "An optimal efficient multi-attribute auction for transportation procurement with carriers having multi-unit supplies," Omega, Elsevier, vol. 83(C), pages 249-260.
    4. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    5. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.
    6. Ching-Hua Chen-Ritzo & Terry P. Harrison & Anthony M. Kwasnica & Douglas J. Thomas, 2005. "Better, Faster, Cheaper: An Experimental Analysis of a Multiattribute Reverse Auction Mechanism with Restricted Information Feedback," Management Science, INFORMS, vol. 51(12), pages 1753-1762, December.
    7. Rochet, Jean-Charles, 1987. "A necessary and sufficient condition for rationalizability in a quasi-linear context," Journal of Mathematical Economics, Elsevier, vol. 16(2), pages 191-200, April.
    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. Pham, Long & Teich, Jeffrey & Wallenius, Hannele & Wallenius, Jyrki, 2015. "Multi-attribute online reverse auctions: Recent research trends," European Journal of Operational Research, Elsevier, vol. 242(1), pages 1-9.
    2. Jason Shachat & Lijia Wei, 2012. "Procuring Commodities: First-Price Sealed-Bid or English Auctions?," Marketing Science, INFORMS, vol. 31(2), pages 317-333, March.
    3. repec:wyi:journl:002158 is not listed on IDEAS
    4. Jie Xiang & Juliang Zhang & T. C. E. Cheng & Jose Maria Sallan & Guowei Hua, 2019. "Efficient Multi-Attribute Auctions Considering Supply Disruption," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-28, June.
    5. Wang, Hong, 2013. "Contingent payment auction mechanism in multidimensional procurement auctions," European Journal of Operational Research, Elsevier, vol. 224(2), pages 404-413.
    6. 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).
    7. Kos, Nenad & Messner, Matthias, 2013. "Extremal incentive compatible transfers," Journal of Economic Theory, Elsevier, vol. 148(1), pages 134-164.
    8. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    9. Peter Postl, 2013. "Efficiency versus optimality in procurement," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(2), pages 425-472, June.
    10. Cheng, Meng & Xu, Su Xiu & Huang, George Q., 2016. "Truthful multi-unit multi-attribute double auctions for perishable supply chain trading," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 21-37.
    11. Sander Onderstal & Yang Yang, 2020. "Cheap-talk Communication in Procurement Auctions: Theory and Experiment," Tinbergen Institute Discussion Papers 20-013/VII, Tinbergen Institute.
    12. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    13. X. Ruiz del Portal, 2012. "Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 311-321, December.
    14. Yonatan Gur & Gregory Macnamara & Daniela Saban, 2022. "Sequential Procurement with Contractual and Experimental Learning," Management Science, INFORMS, vol. 68(4), pages 2714-2731, April.
    15. Banerjee, Simanti & Conte, Marc N., 2017. "Balancing Complexity and Rent-Seeking in Multi-Attribute Conservation Procurement Auctions: Evidence from a Laboratory Experiment," 2018 Allied Social Sciences Association (ASSA) Annual Meeting, January 5-7, 2018, Philadelphia, Pennsylvania 266293, Agricultural and Applied Economics Association.
    16. Alexey Malakhov & Rakesh V. Vohra, 2004. "Single and Multi-Dimensional Optimal Auctions - A Network Approach," Discussion Papers 1397, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Olivier Bochet, 2007. "Implementation of the Walrasian correspondence: the boundary problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(2), pages 301-316, October.
    18. Paul H. Edelman & John A. Weymark, 2021. "Dominant strategy implementability and zero length cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1091-1120, November.
    19. Berger, A. & Müller, R.J. & Naeemi, S.H., 2010. "Path-monotonicity and incentive compatibility," Research Memorandum 035, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    20. Birgit Heydenreich & Rudolf Müller & Marc Uetz & Rakesh V. Vohra, 2009. "Characterization of Revenue Equivalence," Econometrica, Econometric Society, vol. 77(1), pages 307-316, January.
    21. Frank Yang, 2022. "The Simple Economics of Optimal Bundling," Papers 2212.12623, arXiv.org, revised Apr 2023.

    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:gam:jmathe:v:11:y:2023:i:14:p:3240-:d:1200822. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.