A Combinatorial Auction Protocol among Versatile Experts and Amateurs

Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned items is often difficult for amateurs, in particular, in Internet auctions. However, experts can correctly judge the quality of items....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. s. 378 - 385
Hlavní autori: Ito, Takayuki, Yokoo, Makoto, Matsubara, Shigeo
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 19.07.2004
IEEE
Edícia:ACM Conferences
Predmet:
ISBN:9781581138641, 1581138644
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned items is often difficult for amateurs, in particular, in Internet auctions. However, experts can correctly judge the quality of items. In this situation, it is difficult to force experts to tell the truth and attain an efficient allocation since they have a clear advantage over amateurs; without some reward they cannot be expected to reveal their valuable information. In our previous work, we successfully develop such auction protocols under the following two cases: (1) a single-unit auction among experts and amateurs, and (2) a combinatorial auction among single-skilled experts and amateurs. In this paper we focus on versatile experts, who have interest in and expert knowledge of the qualities of several items. In the case of versatile experts, there are several problems, e.g., free riding problems, if we simply extend the previous VCG-style auction protocol. Thus, in this paper, we employ a PORF (price-oriented, rationing-free) protocol for designing our new protocol to realize a strategy-proof auction protocol for experts. In the protocol, the dominant strategy for experts is telling the truth. Also for amateurs, telling the truth is the best response when two or more experts select the dominant strategy. Furthermore, the protocol is false-name-proof.
AbstractList Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned items is often difficult for amateurs, in particular, in Internet auctions. However, experts can correctly judge the quality of items. In this situation, it is difficult to force experts to tell the truth and attain an efficient allocation since they have a clear advantage over amateurs; without some reward they cannot be expected to reveal their valuable information. In our previous work, we successfully develop such auction protocols under the following two cases: (1) a single-unit auction among experts and amateurs, and (2) a combinatorial auction among single-skilled experts and amateurs. In this paper we focus on versatile experts, who have interest in and expert knowledge of the qualities of several items. In the case of versatile experts, there are several problems, e.g., free riding problems, if we simply extend the previous VCG-style auction protocol. Thus, in this paper, we employ a PORF (price-oriented, rationing-free) protocol for designing our new protocol to realize a strategy-proof auction protocol for experts. In the protocol, the dominant strategy for experts is telling the truth. Also for amateurs, telling the truth is the best response when two or more experts select the dominant strategy. Furthermore, the protocol is false-name-proof.
Author Yokoo, Makoto
Matsubara, Shigeo
Ito, Takayuki
Author_xml – sequence: 1
  givenname: Takayuki
  surname: Ito
  fullname: Ito, Takayuki
  organization: Nagoya Institute of Technology
– sequence: 2
  givenname: Makoto
  surname: Yokoo
  fullname: Yokoo, Makoto
  organization: Kyushu University
– sequence: 3
  givenname: Shigeo
  surname: Matsubara
  fullname: Matsubara, Shigeo
  organization: NTT Communication Science Laboratories
BookMark eNqNkDFPwzAUhC0BElA6M7B4QiwtfnEcO2NUtYBUCQZgtRznBRmSuNiOBP-eVO0P4JaT3t294bskp4MfkJBrYEsx6R4YqJyVy71LyU7IvJQKhALgqsjhnMxj_GSTcgF5ll2QdUVXvq_dYJIPznS0Gm1yfqAvwSdvfUdN74cP-o4hmuQ6pOufHYYUqRkaWvUm4RjiFTlrTRdxfvQZedusX1ePi-3zw9Oq2i4MlJAWBTQFQpM1wC03mSxEm2etVCVHIRnHFtCUWWPbejrZQmW1bbgoeGu4tRJLPiO3h7-74L9HjEn3LlrsOjOgH6PmwJTiRT4Vbw5Fh4h6F1xvwq8GLrlgMKXLQ2psr2vvv6IGpvcA9RGgPgLUdXDYToO7fw74HwSNcXA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.5555/1018409.1018770
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 385
ExternalDocumentID 1373501
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
OCL
RIB
RIC
RIE
RIL
AAWTH
LHSKQ
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a191t-61d6e1d2d13c3a2765f42f7893e5703ef1ea92dcfb893c682bcd3563fa3cc7e93
IEDL.DBID RIE
ISBN 9781581138641
1581138644
IngestDate Thu Jul 10 19:13:13 EDT 2025
Tue Aug 26 18:16:55 EDT 2025
Wed Jan 31 06:47:20 EST 2024
Wed Jan 31 06:44:12 EST 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MeetingName AAMAS04: The Third International Joint Conference on Autonomous Agents and Multi-Agent Systems 2004
MergedId FETCHMERGED-LOGICAL-a191t-61d6e1d2d13c3a2765f42f7893e5703ef1ea92dcfb893c682bcd3563fa3cc7e93
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31088364
PQPubID 23500
PageCount 8
ParticipantIDs acm_books_10_5555_1018409_1018770_brief
proquest_miscellaneous_31088364
ieee_primary_1373501
acm_books_10_5555_1018409_1018770
PublicationCentury 2000
PublicationDate 20040719
20040000
20040701
PublicationDateYYYYMMDD 2004-07-19
2004-01-01
2004-07-01
PublicationDate_xml – month: 07
  year: 2004
  text: 20040719
  day: 19
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004.
PublicationTitleAbbrev AAMAS
PublicationYear 2004
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0000451422
Score 1.3606697
Snippet Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of...
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 378
SubjectTerms Applied computing -- Electronic commerce -- E-commerce infrastructure
Computing methodologies -- Artificial intelligence -- Distributed artificial intelligence
Electronic commerce
Indium tin oxide
Intelligent systems
Internet
Laboratories
Mathematics of computing -- Discrete mathematics -- Combinatorics -- Combinatorial algorithms
Multiagent systems
Permission
Protocols
Resource management
Title A Combinatorial Auction Protocol among Versatile Experts and Amateurs
URI https://ieeexplore.ieee.org/document/1373501
https://www.proquest.com/docview/31088364
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB52xYMnH6u4PiMIXqyapk3So4jiSTwoeAtpMgVBu7Ld9fc703bXg4LYU59QJpNMvpnk-wBOY56ZYHOdBFVWSRa9SmwwOimvYqpCqX1hOrEJ8_BgX16KxwGcL_fCIGK7-Awv-LSt5cdJmHOq7FIqw3WwIQyNMd1erWU-hXlSspSBl8ytlMpSoO8pnRbXsqP2yem4ZKIqgjYMXq1hpeKhD--9wsqPYbmNNXfr__vLDdj-3rQnHpfhaBMGWG_B-kK1QfSdeAS314K8jAAxw23yPuE7AlnBlA0T8gvRChAJXq9BzfaGolUBmDXC15Ge0eR0Pm224fnu9unmPunFFBJPkGxGEDFqlDGNUgXlU6PzKksrQ9MVZBIurCT6Io2hKulW0DYtQ1S5VpVXIRgs1A6s1JMad0HIMtg06ooGqJhxmQ-L0lvlGaz4q4BjOCFjOkYJjSOQwQZ3vcFdb_AxnP35jiunr1iNYcQ2dh8d-4brzTuG40UjOeoRXObwNU7mjaMJq7VKZ3u_f7gPa93qG06jHMDKbDrHQ1gNn7PXZnrUOtUX-v_E8Q
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB7xkuiJ8lK3DzBSJS4EsJ3YzrGqQKDSFQcqcbMceyIh0Wy12eX3M5Nkl0OREDnlKUXjscffjP19AN9TkdvoCpNFXdVZnoLOXLQmq86T0rEyobS92IQdj939fXm7AifLvTCI2C0-w1M-7Wr5aRLnnCo7k9pyHWwV1os8V7LfrbXMqDBTSq4YesnCSakdhfqB1GlxLXtyn4KOM6aqInDD8NVZ1ipeDfHvoLHy38DcRZvLrff950fYe9m2J26XAWkbVrDZga2FboMYuvEuXPwQ5GcEiRlwk_-J0FPICiZtmJBniE6CSPCKDWq4RxSdDsCsFaFJ9Iymp_Npuwd_Li_ufl5lg5xCFgiUzQgkJoMyqSR11EFZU9S5qi1NWJBpuLCWGEqVYl3RrWicqmLShdF10DFaLPU-rDWTBj-BkFV0KpmahqiUc6EPyyo4HRiuhPOIIzgiY3rGCa0nmMEG94PB_WDwERy_-Y6vpg9Yj2CXbez_9fwbfjDvCA4XjeSpT3ChIzQ4mbeepqzOaZN_fv3DQ9i8uvt942-ux7--wId-LQ4nVb7C2mw6x2-wEZ9mD-30oHOwZ2qbyDg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Autonomous+Agents+and+Multiagent+Systems%3A+Proceedings%2C+3rd+International+Joint+Conference%2C+New+York+City%2C+New+York%2C+2004.&rft.atitle=A+Combinatorial+Auction+Protocol+among+Versatile+Experts+and+Amateurs&rft.au=Ito%2C+Takayuki&rft.au=Yokoo%2C+Makoto&rft.au=Matsubara%2C+Shigeo&rft.date=2004-07-01&rft.isbn=9781581138641&rft.spage=378&rft.epage=385&rft_id=info:doi/10.5555%2F1018409.1018770&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581138641/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581138641/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781581138641/sc.gif&client=summon&freeimage=true