We study the problem of setting a price for a potential buyer with a valuation drawn from an unknown distribution D. The seller has "data" about D in the form of m ≥ 1 i.i.d. samples, and the algorithmic challenge is to use these samples to obtain expected revenue as close as possible to what could be achieved with advance knowledge of D. Our first set of results quantifies the number of samples m that are necessary and sufficient to obtain a …link_to_OA_fulltex
This lecture continues last lecture’s theme of designing an algorithm that performs well on inputs d...
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidde...
This is a study of Bayesian data worth analysis in environmental clean-up applications. Its focus is...
We study the problem of setting a price for a potential buyer with a valuation drawn from an unknown...
A data buyer faces a decision problem under uncertainty. He can augment his initial private informat...
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings...
Crémer and McLean [1985] showed that, when buyers ’ valuations are drawn from a correlated distri-b...
We investigate profit-maximizing versioning plans for an information goods monopolist. The analysis ...
We study valuing the data of a data owner/seller for a data seeker/buyer. Data valuation is often ca...
This paper pursues auctions that are prior-independent. The goal is to design an auction such that, ...
Information is being shared at an unprecedented rate today and has become the most valuable resource...
Value of information (VOI) analyses can help policy makers make informed decisions about whether to ...
The wide variety of pricing policies used in practice by data sellers suggests that there are signif...
The rapid increase of data volumes makes sampling a crucial component of modern data management syst...
We study data acquisition for business analytics considering both data quality and acquisition cost....
This lecture continues last lecture’s theme of designing an algorithm that performs well on inputs d...
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidde...
This is a study of Bayesian data worth analysis in environmental clean-up applications. Its focus is...
We study the problem of setting a price for a potential buyer with a valuation drawn from an unknown...
A data buyer faces a decision problem under uncertainty. He can augment his initial private informat...
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings...
Crémer and McLean [1985] showed that, when buyers ’ valuations are drawn from a correlated distri-b...
We investigate profit-maximizing versioning plans for an information goods monopolist. The analysis ...
We study valuing the data of a data owner/seller for a data seeker/buyer. Data valuation is often ca...
This paper pursues auctions that are prior-independent. The goal is to design an auction such that, ...
Information is being shared at an unprecedented rate today and has become the most valuable resource...
Value of information (VOI) analyses can help policy makers make informed decisions about whether to ...
The wide variety of pricing policies used in practice by data sellers suggests that there are signif...
The rapid increase of data volumes makes sampling a crucial component of modern data management syst...
We study data acquisition for business analytics considering both data quality and acquisition cost....
This lecture continues last lecture’s theme of designing an algorithm that performs well on inputs d...
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidde...
This is a study of Bayesian data worth analysis in environmental clean-up applications. Its focus is...