Earning Sans Learning: Noisy Decision-Making and Labor Supply on Gig
Economy Platforms
- URL: http://arxiv.org/abs/2111.00002v1
- Date: Thu, 28 Oct 2021 04:13:53 GMT
- Title: Earning Sans Learning: Noisy Decision-Making and Labor Supply on Gig
Economy Platforms
- Authors: Daniel Freund and Chamsi Hssaine
- Abstract summary: We study a gig economy platform's problem of finding optimal compensation schemes when faced with workers who base their participation decisions on limited information with respect to their earnings.
We uncover phenomena that may arise when earnings are volatile and hard to predict, as both the empirical literature and our own data-driven observations suggest may be prevalent on gig economy platforms.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study a gig economy platform's problem of finding optimal compensation
schemes when faced with workers who myopically base their participation
decisions on limited information with respect to their earnings. The stylized
model we consider captures two key, related features absent from prior work on
the operations of on-demand service platforms: (i) workers' lack of information
regarding the distribution from which their earnings are drawn and (ii) worker
decisions that are sensitive to variability in earnings. Despite its stylized
nature, our model induces a complex stochastic optimization problem whose
natural fluid relaxation is also a priori intractable. Nevertheless, we uncover
a surprising structural property of the relaxation that allows us to design a
tractable, fast-converging heuristic policy that is asymptotically optimal
amongst the space of all policies that fulfill a fairness property. In doing
so, via both theory and extensive simulations, we uncover phenomena that may
arise when earnings are volatile and hard to predict, as both the empirical
literature and our own data-driven observations suggest may be prevalent on gig
economy platforms.
Related papers
- Identifiable Latent Neural Causal Models [82.14087963690561]
Causal representation learning seeks to uncover latent, high-level causal representations from low-level observed data.
We determine the types of distribution shifts that do contribute to the identifiability of causal representations.
We translate our findings into a practical algorithm, allowing for the acquisition of reliable latent causal representations.
arXiv Detail & Related papers (2024-03-23T04:13:55Z) - Learning Optimal and Fair Policies for Online Allocation of Scarce
Societal Resources from Data Collected in Deployment [5.0904557821667]
We use administrative data collected in deployment to design an online policy that maximizes expected outcomes while satisfying budget constraints.
We show that using our policies improves rates of exit from homelessness by 1.9% and that policies that are fair in either allocation or outcomes by race come at a very low price of fairness.
arXiv Detail & Related papers (2023-11-23T01:40:41Z) - Delegated Classification [21.384062337682185]
We propose a theoretical framework for incentive-aware delegation of machine learning tasks.
We define budget-optimal contracts and prove they take a simple threshold form under reasonable assumptions.
Empirically, we demonstrate that budget-optimal contracts can be constructed using small-scale data.
arXiv Detail & Related papers (2023-06-20T11:59:03Z) - Delving into Identify-Emphasize Paradigm for Combating Unknown Bias [52.76758938921129]
We propose an effective bias-conflicting scoring method (ECS) to boost the identification accuracy.
We also propose gradient alignment (GA) to balance the contributions of the mined bias-aligned and bias-conflicting samples.
Experiments are conducted on multiple datasets in various settings, demonstrating that the proposed solution can mitigate the impact of unknown biases.
arXiv Detail & Related papers (2023-02-22T14:50:24Z) - When Demonstrations Meet Generative World Models: A Maximum Likelihood
Framework for Offline Inverse Reinforcement Learning [62.00672284480755]
This paper aims to recover the structure of rewards and environment dynamics that underlie observed actions in a fixed, finite set of demonstrations from an expert agent.
Accurate models of expertise in executing a task has applications in safety-sensitive applications such as clinical decision making and autonomous driving.
arXiv Detail & Related papers (2023-02-15T04:14:20Z) - Building a Foundation for Data-Driven, Interpretable, and Robust Policy
Design using the AI Economist [67.08543240320756]
We show that the AI Economist framework enables effective, flexible, and interpretable policy design using two-level reinforcement learning and data-driven simulations.
We find that log-linear policies trained using RL significantly improve social welfare, based on both public health and economic outcomes, compared to past outcomes.
arXiv Detail & Related papers (2021-08-06T01:30:41Z) - Aggregate Learning for Mixed Frequency Data [0.0]
We propose a mixed-temporal aggregate learning model that predicts economic indicators for smaller areas in real-time.
We find that the proposed model predicts (i) the regional heterogeneity of the labor market condition and (ii) the rapidly changing economic status.
The model can be applied to various tasks, especially economic analysis.
arXiv Detail & Related papers (2021-05-20T08:12:43Z) - Towards Robust and Reliable Algorithmic Recourse [11.887537452826624]
We propose a novel framework, RObust Algorithmic Recourse (ROAR), that leverages adversarial training for finding recourses that are robust to model shifts.
We also carry out detailed theoretical analysis which underscores the importance of constructing recourses that are robust to model shifts.
arXiv Detail & Related papers (2021-02-26T17:38:52Z) - Outside the Echo Chamber: Optimizing the Performative Risk [21.62040119228266]
We identify a natural set of properties of the loss function and model-induced distribution shift under which the performative risk is convex.
We develop algorithms that leverage our structural assumptions to optimize the performative risk with better sample efficiency than generic methods for derivative-free convex optimization.
arXiv Detail & Related papers (2021-02-17T04:36:39Z) - Supercharging Imbalanced Data Learning With Energy-based Contrastive
Representation Transfer [72.5190560787569]
In computer vision, learning from long tailed datasets is a recurring theme, especially for natural image datasets.
Our proposal posits a meta-distributional scenario, where the data generating mechanism is invariant across the label-conditional feature distributions.
This allows us to leverage a causal data inflation procedure to enlarge the representation of minority classes.
arXiv Detail & Related papers (2020-11-25T00:13:11Z) - Cost-Sensitive Portfolio Selection via Deep Reinforcement Learning [100.73223416589596]
We propose a cost-sensitive portfolio selection method with deep reinforcement learning.
Specifically, a novel two-stream portfolio policy network is devised to extract both price series patterns and asset correlations.
A new cost-sensitive reward function is developed to maximize the accumulated return and constrain both costs via reinforcement learning.
arXiv Detail & Related papers (2020-03-06T06:28:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.