Efficient Market Making via Convex Optimization, and a Connection to Online Learning
Efficient Market Making via Convex Optimization, and a Connection to Online Learning
复制标题
通过凸优化以及与在线学习的连接实现高效做市
DOI:
--
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
Jennifer Wortman Vaughan
中科院分区:
文献类型:
--
作者:
Jacob D. Abernethy;Yiling Chen;Jennifer Wortman Vaughan
We propose a general framework for the design of securities markets over combinatorial or infinite state or outcome spaces. The framework enables the design of computationally efficient markets tailored to an arbitrary, yet relatively small, space of securities with bounded payoff. We prove that any market satisfying a set of intuitive conditions must price securities via a convex cost function, which is constructed via conjugate duality. Rather than deal with an exponentially large or infinite outcome space directly, our framework only requires optimization over a convex hull. By reducing the problem of automated market making to convex optimization, where many efficient algorithms exist, we arrive at a range of new polynomial-time pricing mechanisms for various problems. We demonstrate the advantages of this framework with the design of some particular markets. We also show that by relaxing the convex hull we can gain computational tractability without compromising the market institution’s bounded budget. Although our framework was designed with the goal of deriving efficient automated market makers for markets with very large outcome spaces, this framework also provides new insights into the relationship between market design and machine learning, and into the complete market setting. Using our framework, we illustrate the mathematical parallels between cost-function-based markets and online learning and establish a correspondence between cost-function-based markets and market scoring rules for complete markets.