How to Sell a Dataset? Pricing Policies for Data Monetization

48 Pages Posted: 19 Feb 2019

See all articles by Sameer Mehta

Sameer Mehta

The University of Texas at Dallas - Naveen Jindal School of Management

Milind Dawande

University of Texas at Dallas - Department of Information Systems & Operations Management

Ganesh Janakiraman

University of Texas at Dallas - Naveen Jindal School of Management

Vijay Mookerjee

University of Texas at Dallas - Naveen Jindal School of Management

Date Written: February 12, 2019

Abstract

The wide variety of pricing policies used in practice by data-sellers suggests that there are significant challenges in pricing datasets. The selling of a dataset – arranged in a row-column format, where rows represent records and columns represent attributes of the records – is more nuanced than that of information goods like telephone minutes and bandwidth, in the sense that, for a buyer, it is not only the amount of data that matters but also the type of the data. We develop a utility framework that is appropriate for data-buyers and the corresponding pricing of the data by the data-seller.

A buyer interested in purchasing a dataset has private valuations in two aspects – her ideal record that she values the most, and the rate at which her valuation for the records in the dataset decays as they differ from her ideal record. The seller allows individual (and heterogeneous) buyers to filter the dataset and select the records that are of interest to them. The multi-dimensional private information of the buyers coupled with the endogenous selection of records makes the seller's problem of optimally pricing the dataset a challenging one. We formulate a tractable model and successfully exploit its special structure to examine it both analytically and numerically. A key result we establish is that, under reasonable assumptions, a price-quantity schedule is an optimal data-selling mechanism. Such a schedule has a nuanced interpretation in the data-selling context in that buyers buy different sets of records but the price for a given number of records does not depend on the identity of the records chosen by the buyer. Even when the assumptions leading to the optimality of a price-quantity schedule do not hold, we show that the optimal price-quantity schedule offers an attractive worst-case performance guarantee relative to an optimal mechanism. Further, we numerically solve for the optimal mechanism and show that the actual performance of two simple and well-known price-quantity schedules – two-part pricing and two-block pricing – is near-optimal. We also quantify the value to the seller from allowing buyers to filter the dataset.

Keywords: Data Monetization, Multi-Dimensional Mechanism Design, Price-Quantity Schedules

JEL Classification: C61, D44, D82, L11

Suggested Citation

Mehta, Sameer and Dawande, Milind and Janakiraman, Ganesh and Mookerjee, Vijay, How to Sell a Dataset? Pricing Policies for Data Monetization (February 12, 2019). Available at SSRN: https://ssrn.com/abstract=3333296 or http://dx.doi.org/10.2139/ssrn.3333296

Sameer Mehta (Contact Author)

The University of Texas at Dallas - Naveen Jindal School of Management ( email )

P.O. Box 830688
Richardson, TX 75083-0688
United States

HOME PAGE: http://www.utdallas.edu/~sameer.mehta/

Milind Dawande

University of Texas at Dallas - Department of Information Systems & Operations Management ( email )

P.O. Box 830688
Richardson, TX 75083-0688
United States

Ganesh Janakiraman

University of Texas at Dallas - Naveen Jindal School of Management ( email )

P.O. Box 830688
Richardson, TX 75083-0688
United States

Vijay Mookerjee

University of Texas at Dallas - Naveen Jindal School of Management ( email )

P.O. Box 830688
Richardson, TX 75083-0688
United States

Register to save articles to
your library

Register

Paper statistics

Downloads
94
rank
270,050
Abstract Views
386
PlumX Metrics