A Market-Affected Sealed-Bid Auction Protocol

被引:0
|
作者
Lindner, Claudia [1 ]
机构
[1] Univ Dusseldorf, Inst Informat, D-40225 Dusseldorf, Germany
关键词
multiagent systems; multiagent resource allocation; auctions; EGALITARIAN-EQUIVALENT;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiagent resource allocation defines the issue of having to distribute a set of resources among a set of agents, aiming at a lair and efficient allocation. Resource allocation procedures can be evaluated with regard to properties such as budget balance and strategy-proofness. Designing a budget-balanced and strategy-proof allocation procedure that always provides a fair (namely, envy-free) and efficient (namely, Pareto-optimal) allocation poses a true challenge. To the best of our knowledge, none of the existing procedures combines all four properties. Moreover, in previous literature no attention is given to the allocation of unwanted resources (i.e., resources that seem to be of no use for all agents) in a way as to maximize social welfare. Yet, dealing inappropriately with unwanted resources may decrease each agent's benefit. Therefore, we extend the scope of sealed-bid auctions by means of involving market prices so as to always provide an optimal solution under consideration of each agent's preferences. We present a new market-affected sealed-bid auction protocol (MSAP) where agents submit sealed bids on indivisible resources, and we allow monetary side-payments. We show this protocol to be budget-balanced and weakly strategy-proof, and to always provide an allocation that maximizes both utilitarian and egalitarian social welfare, and is envy-free and Pareto-optimal.
引用
收藏
页码:193 / 202
页数:10
相关论文
共 50 条
  • [1] A two-server, sealed-bid auction protocol
    Juels, A
    Szydlo, M
    [J]. FINANCIAL CRYPTOGRAPHY, 2003, 2357 : 72 - 86
  • [2] An economic and feasible Quantum Sealed-bid Auction protocol
    Rui Zhang
    Run-hua Shi
    Jia-qi Qin
    Zhen-wan Peng
    [J]. Quantum Information Processing, 2018, 17
  • [3] An efficient sealed-bid auction protocol with two servers
    Shin, Sang Uk
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2006, 22 (06) : 1505 - 1518
  • [4] An economic and feasible Quantum Sealed-bid Auction protocol
    Zhang, Rui
    Shi, Run-hua
    Qin, Jia-qi
    Peng, Zhen-wan
    [J]. QUANTUM INFORMATION PROCESSING, 2018, 17 (02)
  • [5] AN EFFICIENT SEALED-BID AUCTION PROTOCOL WITH BID PRIVACY AND BIDDER PRIVACY
    Shi, Wenbo
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (11): : 7943 - 7953
  • [6] A sealed-bid auction that matches the English auction
    Perry, M
    Wolfstetter, E
    Zamir, S
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2000, 33 (02) : 265 - 273
  • [7] A sealed-bid electronic auction protocol based on ring signature
    Hu, Xiong
    Qin, Zhiguang
    Zhang, Fengli
    Yang, Yong
    Zhao, Yang
    [J]. 2007 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS; VOL 2: SIGNAL PROCESSING, COMPUTATIONAL INTELLIGENCE, CIRCUITS AND SYSTEMS, 2007, : 480 - +
  • [8] Secure quantum sealed-bid auction
    Naseri, Mosayeb
    [J]. OPTICS COMMUNICATIONS, 2009, 282 (09) : 1939 - 1943
  • [9] Quantum sealed-bid auction protocol for simultaneous ascending auction with GHZ states
    Xu, Yuguang
    Li, Zexi
    Wang, Chaonan
    Zhu, Hongfeng
    [J]. QUANTUM INFORMATION PROCESSING, 2021, 20 (07)
  • [10] Quantum sealed-bid auction protocol for simultaneous ascending auction with GHZ states
    Yuguang Xu
    Zexi Li
    Chaonan Wang
    Hongfeng Zhu
    [J]. Quantum Information Processing, 2021, 20