Koutarou Suzuki and Makoto Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Proceedings of the Sixth International Financial Cryptography Conference, pages 44--56, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exchanges for Complex Commodities: Search for Optimal Matches - Gong (2002) (9 citations) (Correct)
....for clearing the auctions that satis ed these conditions. Yokoo et al. 2001a, 2001b] considered a problem of false name bids, that is, manipulation of prices by creating ctitious users and submitting bids without intention to buy; they proposed auction rules that discouraged such bids. Suzuki and Yokoo [2002] studied another security problem in combinatorial auctions; they investigated techniques for clearing an auction without revealing the content of bids to the auctioneer. They described a distributed dynamic programming algorithm that found matches without revealing the bids to the auction ....
Koutarou Suzuki and Makoto Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Proceedings of the Sixth International Financial Cryptography Conference, 2002.
Protocol/Mechanism Design for Cooperation/Competition - Yokoo (2004) Self-citation (Yokoo) (Correct)
No context found.
K. Suzuki and M. Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Proceedings of Sixth International Financial Cryptography Conference (FC-02), Lecture Notes in Computer Science 2357, pages 44--56. Springer, 2002.
Secure Generalized Vickrey Auction without Third-party Servers - Yokoo, Suzuki (2004) (1 citation) Self-citation (Suzuki Yokoo) (Correct)
No context found.
K. Suzuki and M. Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Proceedings of Sixth International Financial Cryptography Conference (FC-02), Lecture Notes in Computer Science 2357, pages 44--56. Springer, 2002.
Secure Multi-agent Dynamic Programming based on Homomorphic.. - Yokoo, al. (2002) (5 citations) Self-citation (Suzuki Yokoo) (Correct)
....auctions, i.e. multi unit auctions, linear good auctions, and general combinatorial auctions. One limitation of the proposed method is that it does not achieve level 0 security. We have developed an alternative method that can achieve level 0 security, while it requires more servers [20]. Although dynamic programming is a very powerful, widelyused combinatorial optimization method, applying dynamic programming techniques to general combinatorial auctions is not feasible for large scale problems, since it requires an exponential number of nodes. Currently, we are investigating ....
K. Suzuki and M. Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Sixth International Financial Cryptography Conference (FC-02), 2002.
Exchange Market for Complex Commodities: Search for Optimal.. - Fink, Gong, Johnson (Correct)
No context found.
Koutarou Suzuki and Makoto Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In Proceedings of the Sixth International Financial Cryptography Conference, pages 44--56, 2002.
Deception in Electronic Auctions - Brandt (2003) (Correct)
No context found.
K. Suzuki and M. Yokoo. Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In M. Blaze, editor, Proceedings of the 6th Annual Conference on Financial Cryptography (FC), volume 2357 of Lecture Notes in Computer Science. Springer, 2002. to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC