Sameer Mehta

Sameer Mehta

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2023 in Digital
Verified
Journal Article
Open access
PDF file
Michael BühlerMichael Bühler
Michael Bühler
Igor CalzadaIgor Calzada
Igor Calzada
ICIsabel Cane
Isabel Cane
Thorsten JelinekThorsten Jelinek
Thorsten Jelinek
AKAstha Kapoor
Astha Kapoor
Jian ZhuJian Zhu
Jian Zhu
Network effects, economies of scale, and lock-in-effects increasingly lead to a concentration of digital resources and capabilities, hindering the free and equitable development of digital entrepreneurship, new skills, and jobs, especially in small communities and their small and medium-sized enterprises (“SMEs”). To ensure the affordability and accessibility of technologies, promote digital entrepreneurship and community well-being, and protect digital rights, we propose data cooperatives as a vehicle for secure, trusted, and sovereign data exchange. In post-pandemic times, community/SME-led cooperatives can play a vital role by ensuring that supply chains to support digital commons are uninterrupted, resilient, and decentralized. Digital commons and data sovereignty provide communities with affordable and easy access to information and the ability to collectively negotiate data-related decisions. Moreover, cooperative commons (a) provide access to the infrastructure that underpins the modern economy, (b) preserve property rights, and (c) ensure that privatization and monopolization do not further erode self-determination, especially in a world increasingly mediated by AI. Thus, governance plays a significant role in accelerating communities’/SMEs’ digital transformation and addressing their challenges. Cooperatives thrive on digital governance and standards such as open trusted application programming interfaces (“APIs”) that increase the efficiency, technological capabilities, and capacities of participants and, most importantly, integrate, enable, and accelerate the digital transformation of SMEs in the overall process. This review article analyses an array of transformative use cases that underline the potential of cooperative data governance. These case studies exemplify how data and platform cooperatives, through their innovative value creation mechanisms, can elevate digital commons and value chains to a new dimension of collaboration, thereby addressing pressing societal issues. Guided by our research aim, we propose a policy framework that supports the practical implementation of digital federation platforms and data cooperatives. This policy blueprint intends to facilitate sustainable development in both the Global South and North, fostering equitable and inclusive data governance strategies.

1 December 2021 in Information Systems Research
Verified
Journal Article
Closed access
SMSameer Mehta
Sameer Mehta
MDMilind Dawande
Milind Dawande
GJGanesh Janakiraman
Ganesh Janakiraman
VMVijay Mookerjee
Vijay Mookerjee
The wide variety of pricing policies used in practice by data sellers suggests that there are significant challenges in pricing data sets. In this paper, we develop a utility framework that is appropriate for data buyers and the corresponding pricing of the data by the data seller. Buyers interested in purchasing a data set have private valuations in two aspects—their ideal record that they value the most, and the rate at which their valuation for the records in the data set decays as they differ from the buyers’ ideal record. The seller allows individual buyers to filter the data set and select the records that are of interest to them. The multidimensional private information of the buyers coupled with the endogenous selection of records makes the seller’s problem of optimally pricing the data set a challenging one. We formulate a tractable model and successfully exploit its special structure to obtain optimal and near-optimal data-selling mechanisms. Specifically, we provide insights into the conditions under which a commonly used mechanism—namely, a price-quantity schedule—is optimal for the data seller. When the conditions 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 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—namely, two-part tariff and two-block tariff—is near optimal. We also quantify the value to the seller from allowing buyers to filter the data set.

21 January 2022 in Production and Operations Management
Verified
Journal Article
Closed access
PDF file
SMSameer Mehta
Sameer Mehta
MDMilind Dawande
Milind Dawande
GJGanesh Janakiraman
Ganesh Janakiraman
VMVijay Mookerjee
Vijay Mookerjee

12 February 2019 in SSRN Electronic Journal
Verified
Preprint
Open access
PDF file
SMSameer Mehta
Sameer Mehta
MDMilind Dawande
Milind Dawande
GJGanesh Janakiraman
Ganesh Janakiraman
VMVijay Mookerjee
Vijay Mookerjee
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.

7 April 2023 in Preprints.org
Verified
Preprint
Open access
MBMichael Max Bühler
Michael Max Bühler
Igor CalzadaIgor Calzada
Igor Calzada
ICIsabel Cane
Isabel Cane
TJThorsten Jelinek
Thorsten Jelinek
AKAstha Kapoor
Astha Kapoor
Jian ZhuJian Zhu
Jian Zhu
Network effects, economies of scale, and lock-in-effects increasingly lead to a concentration of digital resources and capabilities, hindering the free and equitable development of digital entrepreneurship (SDG9), new skills, and jobs (SDG8), especially in small communities (SDG11) and their small and medium-sized enterprises (“SMEs”). To ensure the affordability and accessibility of technologies, promote digital entrepreneurship and community well-being (SDG3), and protect digital rights, we propose data cooperatives [1,2] as a vehicle for secure, trusted, and sovereign data exchange [3,4]. In post-pandemic times, community/SME-led cooperatives can play a vital role by ensuring that supply chains to support digital commons are uninterrupted, resilient, and decentralized [5]. Digital commons and data sovereignty provide communities with affordable and easy access to information and the ability to collectively negotiate data-related decisions. Moreover, cooperative commons (a) provide access to the infrastructure that underpins the modern economy, (b) preserve property rights, and (c) ensure that privatization and monopolization do not further erode self-determination, especially in a world increasingly mediated by AI. Thus, governance plays a significant role in accelerating communities’/SMEs’ digital transformation and addressing their challenges. Cooperatives thrive on digital governance and standards such as open trusted Application Programming Interfaces (APIs) that increase the efficiency, technological capabilities, and capacities of participants and, most importantly, integrate, enable, and accelerate the digital transformation of SMEs in the overall process. This policy paper presents and discusses several transformative use cases for cooperative data governance. The use cases demonstrate how platform/data-cooperatives, and their novel value creation can be leveraged to take digital commons and value chains to a new level of collaboration while addressing the most pressing community issues. The proposed framework for a digital federated and sovereign reference architecture will create a blueprint for sustainable development both in the Global South and North.

1 March 2020 in Information Systems Research
Verified
Journal Article
Closed access
SMSameer Mehta
Sameer Mehta
MDMilind Dawande
Milind Dawande
GJGanesh Janakiraman
Ganesh Janakiraman
VMVijay Mookerjee
Vijay Mookerjee
At an ad exchange, impressions are sold to advertisers in real time through an auction mechanism. The traditional mechanism at these exchanges selects a single advertiser whose ad is displayed over the entire duration of an impression, that is, throughout the user's visit. We argue that such a mechanism leads to an allocative inefficiency. Our goal in this paper is to address this efficiency loss by offering mechanisms in which multiple ads can be displayed sequentially over the lifetime of the impression. We consider two plausible settings—one where each auction is individually rational for the advertisers and another where advertisers are better off relative to the traditional mechanism over the long run—and derive an optimal mechanism for each setting. Under the former mechanism, whereas the ad exchange always benefits relative to the traditional mechanism, the advertisers can either gain or lose—we demonstrate both these possibilities. The optimal mechanism for the latter setting is a mutually beneficial mechanism in that it guarantees a win–win for both the parties relative to the traditional mechanism over the long run. Happily, for both the mechanisms, the allocation of ads and the payments from the advertisers are efficiently computable, thereby making them amenable to real-time bidding.