(Enter summary)
Abstract: This paper presents a secure Generalized Vickrey Auction
(GVA) scheme that does not require third-party servers, i.e., the scheme
is executed only by an auctioneer and bidders. Combinatorial auctions,
in which multiple goods are sold simultaneously, have recently attracted
considerable attention. The GVA can handle combinatorial auctions and
has good theoretical characteristics such as incentive compatibility and
Pareto e#ciency. (Update)
Cited by: More
Protocol/Mechanism Design for Cooperation/Competition - Yokoo (2004)
(Correct)
Design Issues for Electronic Auctions - Trevathan, Ghodosi, Read (2005)
(Correct)
Active bibliography (related documents): More All
1.9: Secure Combinatorial Auctions by Dynamic Programming with.. - Suzuki, Yokoo (2002)
(Correct)
1.5: Deception in Electronic Auctions - Brandt (2003)
(Correct)
1.2: A Study on Electronic Auctions - Omote (2002)
(Correct)
Similar documents based on text:
0.7: Secure Multi-agent Dynamic Programming based on Homomorphic.. - Yokoo, al. (2002)
(Correct)
0.1: Application of Variational Bayesian Approach to Speech .. - Watanabe, Minami..
(Correct)
Related documents from co-citation: More All
2: Robust combinatorial auction protocol against false-name bids
- Yokoo, Sakurai et al. - 2000
2: Robust double auction protocol against false-name bids
- Yokoo, Sakurai et al. - 2001
2: An asynchronous complete method for distributed constraint optimization
- Modi, Shen et al. - 2003
BibTeX entry: (Update)
M. Yokoo and K. Suzuki, "Secure Generalized Vickrey Auction without Thirdparty Servers," in Proceedings of Financial Cryptography, Lecture Notes in Computer Science, Springer-Verlag, 1999. http://citeseer.ist.psu.edu/yokoo04secure.html More
@misc{ yokoo99secure,
author = "M. Yokoo and K. Suzuki",
title = "Secure Generalized Vickrey Auction without Thirdparty Servers",
text = "M. Yokoo and K. Suzuki, Secure Generalized Vickrey Auction without Thirdparty
Servers, in Proceedings of Financial Cryptography, Lecture Notes in Computer
Science, Springer-Verlag, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/yokoo04secure.html" }
Citations (may not include all citations):
408
Princeton University Press (context) - Bellman - 1957
215
Multipart pricing of public goods (context) - Clarke - 1971
214
Incentives in teams (context) - Groves - 1973
185
How to generate and exchange secrets (context) - Yao - 1986
184
Computationally manageable combinatorial auctions
- Rothkopf, Pekec et al. - 1998
184
An algorithm for optimal winner determination in combinatori..
- Sandholm - 1999
174
and competitive sealed tenders (context) - Vickrey, auctions - 1961
162
Public-key cryptosystems based on composite degree residuosi..
- Paillier - 1999
89
A threshold cryptosystem without a trusted party (context) - Pedersen - 1991
86
Auction theory: A guide to the literature (context) - Klemperer - 1999
85
Combinatorial auctions: A survey
- de Vries, Vohra - 2003
79
Selling spectrum rights (context) - McMillan - 1994
79
Privacy preserving auctions and mechanism design
- Naor, Pinkas et al. - 1999
75
Economic mechanism design for computerized agents
- Varian - 1995
37
Electronic auctions with private bids
- Harkavy, Tygar et al. - 1998
31
Auction Theory (context) - Krishna - 2002
30
Fair on-line auctions without special trusted parties
- Stubblebine, Syverson - 1999
22
st-Price auction protocol (context) - Kikuchi - 2001
20
Non-interactive private auctions
- Baudron, Stern - 2001
20
Robust combinatorial auction protocol against false-name bid..
- Yokoo, Sakurai et al. - 2001
19
Multi-round anonymous auction protocols
- Kikuchi, Harkavy et al. - 1998
16
st price auction using homomorphic encryption (context) - Abe, Suzuki - 2002
15
Fully private auctions in a constant number of rounds
- Brandt - 2003
14
cient private bidding and auctions with an oblivious third p.. (context) - Cachin - 1999
13
A bulletin-board based digital auction scheme with bidding d.. (context) - Sakurai, Miyazaki - 1999
12
Secure electronic sealed-bid auction protocol with public ke.. (context) - Kudo - 1998
9
Reducing the round complexity of a sealed-bid auction protoc.. (context) - Watanabe, Imai - 2000
8
An anonymous auction protocol with a single non-trusted cent.. (context) - Omote, Myaji - 1975
7
Secure multi-agent dynamic programming based on homomorphic ..
- Yokoo, Suzuki - 2002
6
sealed-bid auction protocol (context) - Juels, Szydlo et al. - 2002
6
Secure combinatorial auctions by dynamic programming with po..
- Suzuki, Yokoo - 2002
3
A second-price sealed-bid auction with the discriminant of t.. (context) - Omote, Miyaji - 2002
3
Secure Generalized Vickrey Auction using homomorphic encrypt.. (context) - Suzuki, Yokoo - 2003
3
ect of false-name bids in combinatorial auctions: New fraud .. (context) - Yokoo, Sakurai et al.
3
cient sealed-bid auction using hash chain (context) - Suzuki, Kobayashi et al. - 2000
3
Universally verifiable auction protocol which hides losing b.. (context) - Sako - 2000
2
cient sealed-bid auctions for massive numbers of bidders wit.. (context) - Chida, Kobayashi et al. - 2001
2
cient sealed-bid auction by using one-way functions (context) - Kobayashi, Morita et al. - 2001
1
sealed-bid auction protocol (context) - Lipmaa, Niemi et al. - 2002
1
Why are vickrey auctions are rare (context) - Rothkopf, Teisberg et al. - 1990
Documents on the same site (http://www.tcs.hut.fi/~helger/crypto/link/protocols/auctions.html): More
Self Reordering for security in Generalized English Auctions.. - Silaghi, Faltings (2002)
(Correct)
An Algorithm Applicable to Clearing Combinatorial Exchanges - Silaghi (2002)
(Correct)
SAM: A Flexible and Secure Auction Architecture Using.. - Perrig, Smith, Song.. (1991)
(Correct)
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