The Possibilities and Limitations of Private Prediction Markets

Author:

Cummings Rachel1,Pennock David M.2,Vaughan Jennifer Wortman2

Affiliation:

1. Georgia Institute of Technology, Atlanta, GA

2. Microsoft Research, New York, NY

Abstract

We consider the design of private prediction markets , financial markets designed to elicit predictions about uncertain events without revealing too much information about market participants’ actions or beliefs. Our goal is to design market mechanisms in which participants’ trades or wagers influence the market’s behavior in a way that leads to accurate predictions, yet no single participant has too much influence over what others are able to observe. We study the possibilities and limitations of such mechanisms using tools from differential privacy. We begin by designing a private one-shot wagering mechanism in which bettors specify a belief about the likelihood of a future event and a corresponding monetary wager. Wagers are redistributed among bettors in a way that more highly rewards those with accurate predictions. We provide a class of wagering mechanisms that are guaranteed to satisfy truthfulness, budget balance on expectation, and other desirable properties while additionally guaranteeing ε-joint differential privacy in the bettors’ reported beliefs, and analyze the trade-off between the achievable level of privacy and the sensitivity of a bettor’s payment to her own report. We then ask whether it is possible to obtain privacy in dynamic prediction markets, focusing our attention on the popular cost-function framework in which securities with payments linked to future events are bought and sold by an automated market maker. We show that under general conditions, it is impossible for such a market maker to simultaneously achieve bounded worst-case loss and ε-differential privacy without allowing the privacy guarantee to degrade extremely quickly as the number of trades grows (at least logarithmically in number of trades), making such markets impractical in settings in which privacy is valued. We conclude by suggesting several avenues for potentially circumventing this lower bound.

Funder

Mozilla Foundation

Google

National Science Foundation

Simons Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)

Reference32 articles.

1. Efficient Market Making via Convex Optimization, and a Connection to Online Learning

2. HANSON’S AUTOMATED MARKET MAKER

3. J. E. Berg R. Forsythe F. D. Nelson and T. A. Rietz. 2001. Results from a dozen years of election futures markets research. In Handbook of Experimental Economic Results C. A. Plott and V. Smith (Eds.). J. E. Berg R. Forsythe F. D. Nelson and T. A. Rietz. 2001. Results from a dozen years of election futures markets research. In Handbook of Experimental Economic Results C. A. Plott and V. Smith (Eds.).

4. VERIFICATION OF FORECASTS EXPRESSED IN TERMS OF PROBABILITY

5. Private and continual release of statistics;Hubert Chan T.-H.;ACM Trans. Info. Syst. Secur.,2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3