Latent Agents in Networks: Estimation and Pricing

08/14/2018
by   Baris Ata, et al.
0

We focus on a setting where agents in a social network consume a product that exhibits positive local network externalities. A seller has access to data on past consumption decisions/prices for a subset of observable agents, and can target these agents with appropriate discounts to exploit network effects and increase her revenues. A novel feature of the model is that the observable agents potentially interact with additional latent agents. These latent agents can purchase the same product from a different channel, and are not observed by the seller. Observable agents influence each other both directly and indirectly through the influence they exert on the latent part. The seller knows the connection structure of neither the observable nor the latent part of the network. We investigate how the seller can use the available data to estimate the matrix that captures the dependence of observable agents' consumption decisions on the prices offered to them. We provide an algorithm for estimating this matrix under an approximate sparsity condition, and obtain convergence rates for the proposed estimator despite the high-dimensionality that allows more agents than observations. Importantly, we then show that this approximate sparsity condition holds under standard conditions present in the literature and hence our algorithms are applicable to a large class of networks. We establish that by using the estimated matrix the seller can construct prices that lead to a small revenue loss relative to revenue-maximizing prices under complete information, and the optimality gap vanishes relative to the size of the network. We also illustrate that the presence of latent agents leads to significant changes in the structure of the revenue-maximizing prices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2023

Envy-free dynamic pricing schemes

A combinatorial market consists of a set of indivisible items and a set ...
research
12/14/2018

Asymptotically Efficient Multi-Unit Auctions via Posted Prices

We study the asymptotic average-case efficiency of static and anonymous ...
research
05/23/2018

Local Tomography of Large Networks under the Low-Observability Regime

This article studies the problem of reconstructing the topology of a net...
research
08/10/2017

On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders

In a Walrasian equilibrium (WE), all bidders are envy-free (EF), meaning...
research
07/21/2021

The Optimality of Upgrade Pricing

We consider a multiproduct monopoly pricing model. We provide sufficient...
research
08/29/2017

Learning to Price with Reference Effects

As a firm varies the price of a product, consumers exhibit reference eff...
research
09/24/2021

Learning to maximize global influence from local observations

We study a family online influence maximization problems where in a sequ...

Please sign up or login with your details

Forgot password? Click here to reset