Characterization of strategy/false-name proof combinatorial auction protocols: Price-oriented, rationing-free protocol

研究成果: ジャーナルへの寄稿Conference article

61 引用 (Scopus)

抄録

This paper introduces a new distinctive class of combinatorial auction protocols called price-oriented, rationing-free (PORF) protocols. The outline of a PORF protocol is as follows: (i) for each bidder, the price of each bundle of goods is determined independently of his/her own declaration (while it can depend on the declarations of other bidders), (ii) we allocate each bidder a bundle that maximizes his/her utility independently of the allocations of other bidders (i.e., rationing-free). Although a PORF protocol appears quite different from traditional protocol descriptions, surprisingly, it is a sufficient and necessary condition for a protocol to be strategy-proof. Furthermore, we show that a PORF protocol satisfying additional conditions is false-name-proof; at the same time, any false-name-proof protocol can be described as a PORF protocol that satisfies the additional conditions. A PORF protocol is an innovative characterization of strategy-proof protocols and the first attempt to characterize false-name-proof protocols. Such a characterization is not only theoretically significant but also useful in practice, since it can serve as a guideline for developing new strategy/false-name proof protocols. We present a new false-name-proof protocol based on the concept of a PORF protocol.

元の言語英語
ページ(範囲)733-739
ページ数7
ジャーナルIJCAI International Joint Conference on Artificial Intelligence
出版物ステータス出版済み - 12 1 2003
外部発表Yes
イベント18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, メキシコ
継続期間: 8 9 20038 15 2003

Fingerprint

protocol
price
allocation
goods

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

これを引用

@article{010504bfac994e759f6d27fc26979239,
title = "Characterization of strategy/false-name proof combinatorial auction protocols: Price-oriented, rationing-free protocol",
abstract = "This paper introduces a new distinctive class of combinatorial auction protocols called price-oriented, rationing-free (PORF) protocols. The outline of a PORF protocol is as follows: (i) for each bidder, the price of each bundle of goods is determined independently of his/her own declaration (while it can depend on the declarations of other bidders), (ii) we allocate each bidder a bundle that maximizes his/her utility independently of the allocations of other bidders (i.e., rationing-free). Although a PORF protocol appears quite different from traditional protocol descriptions, surprisingly, it is a sufficient and necessary condition for a protocol to be strategy-proof. Furthermore, we show that a PORF protocol satisfying additional conditions is false-name-proof; at the same time, any false-name-proof protocol can be described as a PORF protocol that satisfies the additional conditions. A PORF protocol is an innovative characterization of strategy-proof protocols and the first attempt to characterize false-name-proof protocols. Such a characterization is not only theoretically significant but also useful in practice, since it can serve as a guideline for developing new strategy/false-name proof protocols. We present a new false-name-proof protocol based on the concept of a PORF protocol.",
author = "Makoto Yokoo",
year = "2003",
month = "12",
day = "1",
language = "English",
pages = "733--739",
journal = "IJCAI International Joint Conference on Artificial Intelligence",
issn = "1045-0823",

}

TY - JOUR

T1 - Characterization of strategy/false-name proof combinatorial auction protocols

T2 - Price-oriented, rationing-free protocol

AU - Yokoo, Makoto

PY - 2003/12/1

Y1 - 2003/12/1

N2 - This paper introduces a new distinctive class of combinatorial auction protocols called price-oriented, rationing-free (PORF) protocols. The outline of a PORF protocol is as follows: (i) for each bidder, the price of each bundle of goods is determined independently of his/her own declaration (while it can depend on the declarations of other bidders), (ii) we allocate each bidder a bundle that maximizes his/her utility independently of the allocations of other bidders (i.e., rationing-free). Although a PORF protocol appears quite different from traditional protocol descriptions, surprisingly, it is a sufficient and necessary condition for a protocol to be strategy-proof. Furthermore, we show that a PORF protocol satisfying additional conditions is false-name-proof; at the same time, any false-name-proof protocol can be described as a PORF protocol that satisfies the additional conditions. A PORF protocol is an innovative characterization of strategy-proof protocols and the first attempt to characterize false-name-proof protocols. Such a characterization is not only theoretically significant but also useful in practice, since it can serve as a guideline for developing new strategy/false-name proof protocols. We present a new false-name-proof protocol based on the concept of a PORF protocol.

AB - This paper introduces a new distinctive class of combinatorial auction protocols called price-oriented, rationing-free (PORF) protocols. The outline of a PORF protocol is as follows: (i) for each bidder, the price of each bundle of goods is determined independently of his/her own declaration (while it can depend on the declarations of other bidders), (ii) we allocate each bidder a bundle that maximizes his/her utility independently of the allocations of other bidders (i.e., rationing-free). Although a PORF protocol appears quite different from traditional protocol descriptions, surprisingly, it is a sufficient and necessary condition for a protocol to be strategy-proof. Furthermore, we show that a PORF protocol satisfying additional conditions is false-name-proof; at the same time, any false-name-proof protocol can be described as a PORF protocol that satisfies the additional conditions. A PORF protocol is an innovative characterization of strategy-proof protocols and the first attempt to characterize false-name-proof protocols. Such a characterization is not only theoretically significant but also useful in practice, since it can serve as a guideline for developing new strategy/false-name proof protocols. We present a new false-name-proof protocol based on the concept of a PORF protocol.

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

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

M3 - Conference article

AN - SCOPUS:84880767427

SP - 733

EP - 739

JO - IJCAI International Joint Conference on Artificial Intelligence

JF - IJCAI International Joint Conference on Artificial Intelligence

SN - 1045-0823

ER -