Competitive Model Selection in Algorithmic Targeting / Ganesh Iyer, T. Tony Ke.
Material type:
- D43
- L13
- M37
- Hardcopy version available to institutional subscribers
Item type | Home library | Collection | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Working Paper | Biblioteca Digital | Colección NBER | nber w31002 (Browse shelf(Opens below)) | Not For Loan |
Collection: Colección NBER Close shelf browser (Hides shelf browser)
March 2023.
This paper studies how market competition influences the algorithmic design choices of firms in the context of targeting. Firms face the general trade-off between bias and variance when choosing the design of a supervised learning algorithm in terms of model complexity or the number of predictors to accommodate. Each firm then appoints a data analyst that uses the chosen algorithm to estimate demand for multiple consumer segments, based on which, it devises a targeting policy to maximize estimated profit. We show that competition may induce firms to strategically choose simpler algorithms which involve more bias. This implies that more complex/flexible algorithms tend to have higher value for firms with greater monopoly power.
Hardcopy version available to institutional subscribers
System requirements: Adobe [Acrobat] Reader required for PDF files.
Mode of access: World Wide Web.
Print version record
There are no comments on this title.