Bundle design in robust combinatorial auction protocol against false-name bids

Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

Research output: Contribution to journalConference article

14 Citations (Scopus)

Abstract

This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying AI technologies. However, the possibility of a new type of cheating called a false-name bid, i.e., a bid submitted under a fictitious name, has been pointed out. A protocol called Leveled Division Set (LDS) protocol that is robust against false-name bids has been developed. However, this protocol requires the auctioneer to define a leveled division set. A leveled division set is a series of division sets, where a division set is a set of divisions and a division is a combination of bundles of goods. We need to solve a very complicated optimization problem to construct a leveled division set in order to obtain a good social surplus. We have developed a heuristic method for overcoming this problem. In this method, we first find a good division with a winner determination algorithm, and then construct a leveled division set by using this division as a seed. Through a simulation, we showthat our method can obtain a social surplus that is very close to optimal.

Original languageEnglish
Pages (from-to)1095-1101
Number of pages7
JournalIJCAI International Joint Conference on Artificial Intelligence
Publication statusPublished - Dec 1 2001
Event17th International Joint Conference on Artificial Intelligence, IJCAI 2001 - Seattle, WA, United States
Duration: Aug 4 2001Aug 10 2001

Fingerprint

Network protocols
electronic commerce
Heuristic methods
Electronic commerce
heuristics
Seed
Internet
seed
protocol
method
simulation
surplus
goods

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Bundle design in robust combinatorial auction protocol against false-name bids. / Yokoo, Makoto; Sakurai, Yuko; Matsubara, Shigeo.

In: IJCAI International Joint Conference on Artificial Intelligence, 01.12.2001, p. 1095-1101.

Research output: Contribution to journalConference article

@article{32e6be3164ef4644905b9c0d3ecb485f,
title = "Bundle design in robust combinatorial auction protocol against false-name bids",
abstract = "This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying AI technologies. However, the possibility of a new type of cheating called a false-name bid, i.e., a bid submitted under a fictitious name, has been pointed out. A protocol called Leveled Division Set (LDS) protocol that is robust against false-name bids has been developed. However, this protocol requires the auctioneer to define a leveled division set. A leveled division set is a series of division sets, where a division set is a set of divisions and a division is a combination of bundles of goods. We need to solve a very complicated optimization problem to construct a leveled division set in order to obtain a good social surplus. We have developed a heuristic method for overcoming this problem. In this method, we first find a good division with a winner determination algorithm, and then construct a leveled division set by using this division as a seed. Through a simulation, we showthat our method can obtain a social surplus that is very close to optimal.",
author = "Makoto Yokoo and Yuko Sakurai and Shigeo Matsubara",
year = "2001",
month = "12",
day = "1",
language = "English",
pages = "1095--1101",
journal = "IJCAI International Joint Conference on Artificial Intelligence",
issn = "1045-0823",

}

TY - JOUR

T1 - Bundle design in robust combinatorial auction protocol against false-name bids

AU - Yokoo, Makoto

AU - Sakurai, Yuko

AU - Matsubara, Shigeo

PY - 2001/12/1

Y1 - 2001/12/1

N2 - This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying AI technologies. However, the possibility of a new type of cheating called a false-name bid, i.e., a bid submitted under a fictitious name, has been pointed out. A protocol called Leveled Division Set (LDS) protocol that is robust against false-name bids has been developed. However, this protocol requires the auctioneer to define a leveled division set. A leveled division set is a series of division sets, where a division set is a set of divisions and a division is a combination of bundles of goods. We need to solve a very complicated optimization problem to construct a leveled division set in order to obtain a good social surplus. We have developed a heuristic method for overcoming this problem. In this method, we first find a good division with a winner determination algorithm, and then construct a leveled division set by using this division as a seed. Through a simulation, we showthat our method can obtain a social surplus that is very close to optimal.

AB - This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying AI technologies. However, the possibility of a new type of cheating called a false-name bid, i.e., a bid submitted under a fictitious name, has been pointed out. A protocol called Leveled Division Set (LDS) protocol that is robust against false-name bids has been developed. However, this protocol requires the auctioneer to define a leveled division set. A leveled division set is a series of division sets, where a division set is a set of divisions and a division is a combination of bundles of goods. We need to solve a very complicated optimization problem to construct a leveled division set in order to obtain a good social surplus. We have developed a heuristic method for overcoming this problem. In this method, we first find a good division with a winner determination algorithm, and then construct a leveled division set by using this division as a seed. Through a simulation, we showthat our method can obtain a social surplus that is very close to optimal.

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

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

M3 - Conference article

AN - SCOPUS:4544277257

SP - 1095

EP - 1101

JO - IJCAI International Joint Conference on Artificial Intelligence

JF - IJCAI International Joint Conference on Artificial Intelligence

SN - 1045-0823

ER -