{"type":"ScholarlyArticle","title":"Strategyproofness and Monotone Allocation of Auction in Social Networks","authors":[{"name":"Yuhang Guo","slug":"yuhang-guo","given":"Yuhang","family":"Guo","affiliation":""},{"name":"Dong Hao","slug":"dong-hao","given":"Dong","family":"Hao","affiliation":""},{"name":"Bin Li","slug":"bin-li","given":"Bin","family":"Li","affiliation":""},{"name":"Mingyu Xiao","slug":"mingyu-xiao","given":"Mingyu","family":"Xiao","affiliation":""},{"name":"Bakh Khoussainov","slug":"bakh-khoussainov","given":"Bakh","family":"Khoussainov","affiliation":""}],"abstract":"Strategyproofness in network auctions requires that bidders not only report their valuations truthfully, but also do their best to invite  neighbours from the social network.  In contrast to canonical auctions, where the value-monotone allocation in Myerson's Lemma is a cornerstone, a general principle of allocation rules for strategyproof network auctions is still missing. We show that, due to the absence of such a principle, even extensions to multi-unit network auctions with single-unit demand present unexpected difficulties, and all pioneering researches fail to be strategyproof.\r\nFor the first time in this field, we identify two categories of monotone allocation rules on networks: Invitation-Depressed Monotonicity (ID-MON) and Invitation-Promoted Monotonicity (IP-MON). They encompass all existing allocation rules of network auctions as specific instances. For any given ID-MON or IP-MON allocation rule, we characterize the existence and sufficient conditions for the strategyproof  payment rules, and show that among all such payment rules, the revenue-maximizing one exists and is computationally feasible. \r\nWith these results, the  obstacle  of combinatorial network auction with single-minded bidders is now resolved.","doi":"10.24963/ijcai.2025/432","url":"https://ijcai.org/proceedings/2025/432","pdf":"https://ijcai.org/proceedings/2025/0432.pdf","markdown":"https://ijcai.org/proceedings/2025/432.md","bibtex":"https://ijcai.org/proceedings/2025/bibtex/432","volume":{"slug":"2025","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2025","url":"https://ijcai.org/proceedings/2025/","year":2025,"location":"Montreal, Canada","dates":"16-22 August 2025","editors":"James Kwok","isbn":"978-1-956792-06-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2025"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":432,"pages":{"first":3883,"last":3890},"keywords":["Game Theory and Economic Paradigms: GTEP: Mechanism design","Multidisciplinary Topics and Applications: MTA: Economics","Game Theory and Economic Paradigms: GTEP: Auctions and market-based systems"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}