An average-case budget-non-negative double auction protocol

Yuko Sakurai, Makoto Yokoo

研究成果: 会議への寄与タイプ論文

5 引用 (Scopus)

抜粋

We develop a new strategy-proof double auction protocol characterized as average-case budget-non-negative. It is well-known that there is no strategy-proof double auction protocol that satisfies Pareto efficiency, individual rationality, and budget-balance simultaneously. The existing approach is to give up Pareto efficiency or strategy-proofness by enforcing budget-balance or budget-positive as a hard constraint. We propose a new direction to slightly relax the budget-non-negative condition. Although this protocol might incur loss or profit in some cases, it is guaranteed not to exceed the predetermined amount of loss. Simulation results show that this protocol can be budget-non-negative on average and achieve social surplus that is very close to being Pareto efficient by setting parameters appropriately.

元の言語英語
ページ104-111
ページ数8
出版物ステータス出版済み - 1 1 2002
イベントProceedings of the 1st International Joint Conference on: Autonomous Agents adn Multiagent Systems - Bologna, イタリア
継続期間: 7 15 20027 19 2002

その他

その他Proceedings of the 1st International Joint Conference on: Autonomous Agents adn Multiagent Systems
イタリア
Bologna
期間7/15/027/19/02

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Engineering(all)

これを引用

Sakurai, Y., & Yokoo, M. (2002). An average-case budget-non-negative double auction protocol. 104-111. 論文発表場所 Proceedings of the 1st International Joint Conference on: Autonomous Agents adn Multiagent Systems, Bologna, イタリア.