Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Data Auctions with Externalities (2003.08345v6)

Published 18 Mar 2020 in cs.GT

Abstract: The design of data markets has gained importance as firms increasingly use machine learning models fueled by externally acquired training data. A key consideration is the externalities firms face when data, though inherently freely replicable, is allocated to competing firms. In this setting, we demonstrate that a data seller's optimal revenue increases as firms can pay to prevent allocations to others. To do so, we first reduce the combinatorial problem of allocating and pricing multiple datasets to the auction of a single digital good by modeling utility for data through the increase in prediction accuracy it provides. We then derive welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information - whether the externalities one exerts on others is known, or vice-versa - affects the resulting structures. In all cases, under appropriate assumptions, the optimal allocation rule is a single threshold per firm, where either all data is allocated or none is.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Low-cost learning via active data procurement. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC ’15, page 619–636, New York, NY, USA, 2015. Association for Computing Machinery. ISBN 9781450334105. doi: 10.1145/2764468.2764519.
  2. Too much data: Prices and inefficiencies in data markets. Working Paper 26296, National Bureau of Economic Research, September 2019. URL http://www.nber.org/papers/w26296.
  3. The economics of privacy. Journal of economic Literature, 54(2):442–92, 2016.
  4. Selling and trading on information in financial markets. The American Economic Review, 78(2):96–103, 1988.
  5. A marketplace for data: An algorithmic solution. In Proceedings of the 2019 ACM Conference on Economics and Computation, EC ’19, page 701–726, New York, NY, USA, 2019. Association for Computing Machinery. ISBN 9781450367929. doi: 10.1145/3328526.3329589.
  6. An optimal auction with identity-dependent externalities. The RAND Journal of Economics, 39(3):731–746, 2008. doi: 10.1111/j.1756-2171.2008.00036.x.
  7. A survey of data marketplaces and their business models. arXiv preprint arXiv:2201.04561, 2022.
  8. Optimal mechanisms for selling information. In Proceedings of the 13th ACM Conference on Electronic Commerce, pages 92–109, 2012.
  9. Mechanism and network design with private negative externalities. Operations Research, 65(3):577–594, 2017. doi: 10.1287/opre.2016.1585.
  10. Markets for information: An introduction. Annual Review of Economics, 11:85–107, 2019.
  11. Robust predictions in games with incomplete information. Econometrica, 81(4):1251–1308, 2013.
  12. The design and price of information. American economic review, 108(1):1–48, 2018.
  13. The economics of social data. Cowles Foundation Discussion Paper, 2020.
  14. Information sale and competition. Management Science, 65(6):2646–2664, 2019. doi: 10.1287/mnsc.2018.3068.
  15. Selling information in competitive environments, 2022.
  16. Isabelle Brocas. Optimal allocation mechanisms with type-dependent negative externalities. Theory and Decision, 75(3):359–387, September 2013. doi: 10.1007/s11238-012-9345-0.
  17. Quality-based competition, profitability, and variable costs. Management Science, 52(12):1884–1895, 2006.
  18. Constantinos Daskalakis. Multi-item auctions defying intuition? SIGecom Exch., 14(1):41–75, nov 2015. doi: 10.1145/2845926.2845928. URL https://doi.org/10.1145/2845926.2845928.
  19. The complexity of optimal mechanism design. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1302–1318. SIAM, 2014.
  20. Money for nothing: Exploiting negative externalities. In Proceedings of the 12th ACM Conference on Electronic Commerce, EC ’11, page 361–370, New York, NY, USA, 2011. Association for Computing Machinery. ISBN 9781450302616. doi: 10.1145/1993574.1993634.
  21. Online convex optimization in the bandit setting: Gradient descent without a gradient. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’05, page 385–394, USA, 2005. Society for Industrial and Applied Mathematics. ISBN 0898715857.
  22. Selling privacy at auction. In Proceedings of the 12th ACM Conference on Electronic Commerce, EC ’11, page 199–208, New York, NY, USA, 2011. Association for Computing Machinery. ISBN 9781450302616. doi: 10.1145/1993574.1993605.
  23. Competitive auctions. Games and Economic Behavior, 55(2):242 – 269, 2006. ISSN 0899-8256. doi: 10.1016/j.geb.2006.02.003. Mini Special Issue: Electronic Market Design.
  24. Optimal auctions with positive network externalities. ACM Trans. Econ. Comput., 1(2), May 2013. ISSN 2167-8375. doi: 10.1145/2465769.2465778.
  25. Budget feasible mechanisms for experimental design. In Alberto Pardo and Alfredo Viola, editors, LATIN 2014: Theoretical Informatics, pages 719–730, Berlin, Heidelberg, 2014. Springer Berlin Heidelberg. ISBN 978-3-642-54423-1.
  26. Allocative and Informational Externalities in Auctions and Related Mechanisms, volume 1 of Econometric Society Monographs, page 102–135. Cambridge University Press, 2006. doi: 10.1017/CBO9781139052269.005.
  27. How (not) to sell nuclear weapons. The American Economic Review, 86(4):814–829, 1996. ISSN 00028282. doi: 10.2307/2118306.
  28. Multidimensional mechanism design for auctions with externalities. Journal of Economic Theory, 85(2):258 – 293, 1999. ISSN 0022-0531. doi: 10.1006/jeth.1998.2501.
  29. Hayne E Leland. Quality choice and competition. The American Economic Review, 67(2):127–137, 1977.
  30. Roger B. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58–73, 1981. ISSN 0364765X, 15265471.
  31. Michael Raith. A general model of information sharing in oligopoly. Journal of Economic Theory, 71(1):260–288, 1996.
  32. Data sharing markets. arXiv preprint arXiv:2107.08630, 2021.
  33. Conducting truthful surveys, cheaply. In Proceedings of the 13th ACM Conference on Electronic Commerce, EC ’12, page 826–843, New York, NY, USA, 2012. Association for Computing Machinery. ISBN 9781450314152. doi: 10.1145/2229012.2229076.
  34. Consumer privacy in oligopolistic markets: Winners, losers, and welfare. International Journal of Industrial Organization, 34:80–84, 2014.
  35. William Vickrey. Counterspeculation, auctions, and competitive sealed tenders. The Journal of finance, 16(1):8–37, 1961.
  36. Xavier Wauthy. Quality choice in models of vertical differentiation. The Journal of Industrial Economics, pages 345–353, 1996.
  37. Efficient auctions with identity-dependent negative externalities. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’18, page 2156–2158, Richland, SC, 2018. International Foundation for Autonomous Agents and Multiagent Systems.
  38. Amir Ziv. Information sharing in oligopoly: The truth-telling problem. The RAND Journal of Economics, pages 455–465, 1993.
Citations (15)

Summary

We haven't generated a summary for this paper yet.