Robust multi-unit auction protocol against false-name bids

Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

Research output: Contribution to journalArticle

Abstract

This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.

Original languageEnglish
Pages (from-to)390-397
Number of pages8
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume17
Issue number4
DOIs
Publication statusPublished - Dec 1 2002

Fingerprint

Network protocols
Internet
Electronic commerce
Artificial intelligence

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Robust multi-unit auction protocol against false-name bids. / Yokoo, Makoto; Sakurai, Yuko; Matsubara, Shigeo.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 17, No. 4, 01.12.2002, p. 390-397.

Research output: Contribution to journalArticle

@article{7e8d72566b234f929a7508398763c39e,
title = "Robust multi-unit auction protocol against false-name bids",
abstract = "This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.",
author = "Makoto Yokoo and Yuko Sakurai and Shigeo Matsubara",
year = "2002",
month = "12",
day = "1",
doi = "10.1527/tjsai.17.390",
language = "English",
volume = "17",
pages = "390--397",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "4",

}

TY - JOUR

T1 - Robust multi-unit auction protocol against false-name bids

AU - Yokoo, Makoto

AU - Sakurai, Yuko

AU - Matsubara, Shigeo

PY - 2002/12/1

Y1 - 2002/12/1

N2 - This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.

AB - This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.

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

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

U2 - 10.1527/tjsai.17.390

DO - 10.1527/tjsai.17.390

M3 - Article

VL - 17

SP - 390

EP - 397

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 4

ER -