Protocol completion incentive problems in cryptographic Vickrey auctions

@article{Bradford2008ProtocolCI,
  title={Protocol completion incentive problems in cryptographic Vickrey auctions},
  author={Phillip G. Bradford and Sunju Park and Michael H. Rothkopf and Heejin Park},
  journal={Electronic Commerce Research},
  year={2008},
  volume={8},
  pages={57-77}
}
In spite of attractive theoretical properties, Vickrey auctions are seldom actually used due to information revelation and fear of cheating. Cryptographic Vickrey Auctions (CVAs) have been proposed to protect bidders’ privacy or to prevent the bid taker from cheating. This paper has three parts. First, it identifies ideal goals for CVAs. One of the criteria identifies an incentive problem that is new to the literature on cryptographic Vickrey auctions: the disincentive of a bidder who has… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Random Graphs, second edition

  • B. Bollobas
  • 2001
Highly Influential
3 Excerpts

Private Auctions in a Constant Number of Rounds,'

  • F. BrandtFully
  • In the Proceedings of Financial Cryptography (FC
  • 2003

Kruskal: "A Survey of Constant Time Parallel Sorting,

  • W. I. Gasarch, C.P.E. Golub
  • Bulletin of the EATCS (European Association of…
  • 2000

Vickrey Auctions in Practice: From Nineteenth-Century Philately to Twenty-First-Century E-Commerce.

  • D. Lucking-Reiley
  • Journal of Economic Perspectives,
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…