Linear Regression from Strategic Data Sources
Not on the map. Why?
Abstract (arXiv)
Linear regression is a fundamental building block of statistical data analysis. It amounts to estimating the parameters of a linear model that maps input features to corresponding outputs. In the classical setting where the precision of each data point is fixed, the famous Aitken/Gauss-Markov theorem in statistics states that generalized least squares (GLS) is a so-called "Best Linear Unbiased Estimator" (BLUE). In modern data science, however, one often faces strategic data sources, namely, individuals who incur a cost for providing high-precision data. In this paper, we study a setting in which features are public but individuals choose the precision of the outputs they reveal to an analyst. We assume that the analyst performs linear regression on this dataset, and individuals benefit from the outcome of this estimation. We model this scenario as a game where individuals minimize a cost comprising two components: (a) an (agent-specific) disclosure cost for providing high-precision data; and (b) a (global) estimation cost representing the inaccuracy in the linear model estimate. In this game, the linear model estimate is a public good that benefits all individuals. We establish that this game has a unique non-trivial Nash equilibrium. We study the efficiency of this equilibrium and we prove tight bounds on the price of stability for a large class of disclosure and estimation costs. Finally, we study the estimator accuracy achieved at equilibrium. We show that, in general, Aitken's theorem does not hold under strategic data sources, though it does hold if individuals have identical disclosure costs (up to a multiplicative factor). When individuals have non-identical costs, we derive a bound on the improvement of the equilibrium estimation cost that can be achieved by deviating from GLS, under mild assumptions on the disclosure cost functions.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Sep 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 1; 2025: 1.
6 papers.
- 2022Strategic Decision-Making in the Presence of Information Asymmetry: Provably Efficient RL with Algorithmic Instrumentscited by 9
- 2023Learning with Exposure Constraints in Recommendation Systemscited by 8
- 2021Combinatorial Bandits under Strategic Manipulationscited by 6
- 2024Strategic Linear Contextual Banditscited by 4
- 2022Long-term Data Sharing under Exclusivity Attackscited by 1
- 2025COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agentscited by 1
- 2025COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents29 May 2025
- 2024Strategic Linear Contextual Bandits1 Jun 2024
- 2023Learning with Exposure Constraints in Recommendation Systems2 Feb 2023
- 2022Strategic Decision-Making in the Presence of Information Asymmetry: Provably Efficient RL with Algorithmic Instruments23 Aug 2022
- 2022Long-term Data Sharing under Exclusivity Attacks22 Jan 2022
- 2021Combinatorial Bandits under Strategic Manipulations25 Feb 2021