A double auction protocol robust to false-name bids

Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The auction is a fast-developing, important area of electronic commerce in which software agent techniques are expected to find promising applications. By the use of the Internet, large-scale auctions can be realized at low cost. On the other hand, there arises the problem of illegal conduct of a new type, utilizing the name-concealment properties of the network. This paper proposes a new double auction protocol guaranteeing robustness to false-name bids, which constitute one type of such illegal conduct. The double auction is an auction in which multiple buyers/sellers exist and engage in bidding. It is widely used in dealing with foreign currency, credit, stocks, and other goods. For cases in which there is no false-name bid, the double auction protocol (PMD protocol) has been proposed, which is motivation-compatible in the dominant strategy. Considering the possible case in which the seller pretends to be a buyer and bids under another name, it is possible in the PMD protocol for the bidder to increase his benefit by a false-name bid. Thus, motivation compatibility is not guaranteed. This paper proposes the threshold price double auction protocol (TPD), which is motivation-compatible in the dominant strategy even if false-name bids are possible. The TPD protocol has the feature that the number of deals and the prices of deals are controlled by using the threshold price of the good. It is shown by simulation experiments that the TPD protocol realizes a social surplus which is very close to the Pareto-efficient assignment by appropriately setting the threshold price.

Original languageEnglish
Pages (from-to)50-59
Number of pages10
JournalElectronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume88
Issue number5
DOIs
Publication statusPublished - May 2005
Externally publishedYes

Fingerprint

Network protocols
thresholds
electronic commerce
Temperature programmed desorption
Polarization mode dispersion
compatibility
computer programs
Software agents
Electronic commerce
simulation
Internet
Costs
Experiments

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

A double auction protocol robust to false-name bids. / Yokoo, Makoto; Sakurai, Yuko; Matsubara, Shigeo.

In: Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi), Vol. 88, No. 5, 05.2005, p. 50-59.

Research output: Contribution to journalArticle

@article{730c3b9c4c39431d8d99278b91e3fa72,
title = "A double auction protocol robust to false-name bids",
abstract = "The auction is a fast-developing, important area of electronic commerce in which software agent techniques are expected to find promising applications. By the use of the Internet, large-scale auctions can be realized at low cost. On the other hand, there arises the problem of illegal conduct of a new type, utilizing the name-concealment properties of the network. This paper proposes a new double auction protocol guaranteeing robustness to false-name bids, which constitute one type of such illegal conduct. The double auction is an auction in which multiple buyers/sellers exist and engage in bidding. It is widely used in dealing with foreign currency, credit, stocks, and other goods. For cases in which there is no false-name bid, the double auction protocol (PMD protocol) has been proposed, which is motivation-compatible in the dominant strategy. Considering the possible case in which the seller pretends to be a buyer and bids under another name, it is possible in the PMD protocol for the bidder to increase his benefit by a false-name bid. Thus, motivation compatibility is not guaranteed. This paper proposes the threshold price double auction protocol (TPD), which is motivation-compatible in the dominant strategy even if false-name bids are possible. The TPD protocol has the feature that the number of deals and the prices of deals are controlled by using the threshold price of the good. It is shown by simulation experiments that the TPD protocol realizes a social surplus which is very close to the Pareto-efficient assignment by appropriately setting the threshold price.",
author = "Makoto Yokoo and Yuko Sakurai and Shigeo Matsubara",
year = "2005",
month = "5",
doi = "10.1002/ecjb.20180",
language = "English",
volume = "88",
pages = "50--59",
journal = "Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "8756-663X",
publisher = "Scripta Technica",
number = "5",

}

TY - JOUR

T1 - A double auction protocol robust to false-name bids

AU - Yokoo, Makoto

AU - Sakurai, Yuko

AU - Matsubara, Shigeo

PY - 2005/5

Y1 - 2005/5

N2 - The auction is a fast-developing, important area of electronic commerce in which software agent techniques are expected to find promising applications. By the use of the Internet, large-scale auctions can be realized at low cost. On the other hand, there arises the problem of illegal conduct of a new type, utilizing the name-concealment properties of the network. This paper proposes a new double auction protocol guaranteeing robustness to false-name bids, which constitute one type of such illegal conduct. The double auction is an auction in which multiple buyers/sellers exist and engage in bidding. It is widely used in dealing with foreign currency, credit, stocks, and other goods. For cases in which there is no false-name bid, the double auction protocol (PMD protocol) has been proposed, which is motivation-compatible in the dominant strategy. Considering the possible case in which the seller pretends to be a buyer and bids under another name, it is possible in the PMD protocol for the bidder to increase his benefit by a false-name bid. Thus, motivation compatibility is not guaranteed. This paper proposes the threshold price double auction protocol (TPD), which is motivation-compatible in the dominant strategy even if false-name bids are possible. The TPD protocol has the feature that the number of deals and the prices of deals are controlled by using the threshold price of the good. It is shown by simulation experiments that the TPD protocol realizes a social surplus which is very close to the Pareto-efficient assignment by appropriately setting the threshold price.

AB - The auction is a fast-developing, important area of electronic commerce in which software agent techniques are expected to find promising applications. By the use of the Internet, large-scale auctions can be realized at low cost. On the other hand, there arises the problem of illegal conduct of a new type, utilizing the name-concealment properties of the network. This paper proposes a new double auction protocol guaranteeing robustness to false-name bids, which constitute one type of such illegal conduct. The double auction is an auction in which multiple buyers/sellers exist and engage in bidding. It is widely used in dealing with foreign currency, credit, stocks, and other goods. For cases in which there is no false-name bid, the double auction protocol (PMD protocol) has been proposed, which is motivation-compatible in the dominant strategy. Considering the possible case in which the seller pretends to be a buyer and bids under another name, it is possible in the PMD protocol for the bidder to increase his benefit by a false-name bid. Thus, motivation compatibility is not guaranteed. This paper proposes the threshold price double auction protocol (TPD), which is motivation-compatible in the dominant strategy even if false-name bids are possible. The TPD protocol has the feature that the number of deals and the prices of deals are controlled by using the threshold price of the good. It is shown by simulation experiments that the TPD protocol realizes a social surplus which is very close to the Pareto-efficient assignment by appropriately setting the threshold price.

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

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

U2 - 10.1002/ecjb.20180

DO - 10.1002/ecjb.20180

M3 - Article

AN - SCOPUS:19144363903

VL - 88

SP - 50

EP - 59

JO - Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-663X

IS - 5

ER -