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

Yuko Sakurai, Makoto Yokoo

Research output: Contribution to journalArticle

Abstract

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 relax the budget-non-negative condition slightly. Although this protocol might take loss or profit for some cases, it it 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.

Original languageEnglish
Pages (from-to)15-23
Number of pages9
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume18
Issue number1
DOIs
Publication statusPublished - Dec 1 2003

Fingerprint

Profitability

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

An average-case budget-non-negative double auction protocol. / Sakurai, Yuko; Yokoo, Makoto.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 18, No. 1, 01.12.2003, p. 15-23.

Research output: Contribution to journalArticle

@article{569ca49fc8484c2da9924f406f98a043,
title = "An average-case budget-non-negative double auction protocol",
abstract = "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 relax the budget-non-negative condition slightly. Although this protocol might take loss or profit for some cases, it it 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.",
author = "Yuko Sakurai and Makoto Yokoo",
year = "2003",
month = "12",
day = "1",
doi = "10.1527/tjsai.18.15",
language = "English",
volume = "18",
pages = "15--23",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "1",

}

TY - JOUR

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

AU - Sakurai, Yuko

AU - Yokoo, Makoto

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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 relax the budget-non-negative condition slightly. Although this protocol might take loss or profit for some cases, it it 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.

AB - 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 relax the budget-non-negative condition slightly. Although this protocol might take loss or profit for some cases, it it 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.

UR - http://www.scopus.com/inward/record.url?scp=18444383694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18444383694&partnerID=8YFLogxK

U2 - 10.1527/tjsai.18.15

DO - 10.1527/tjsai.18.15

M3 - Article

VL - 18

SP - 15

EP - 23

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 1

ER -