Predicting Individual Treatment Effects of Large-scale Team Competitions in a Ride-sharing Economy

• URL: http://arxiv.org/abs/2008.07364v1
• Date: Fri, 7 Aug 2020 22:01:50 GMT
• Title: Predicting Individual Treatment Effects of Large-scale Team Competitions in a Ride-sharing Economy
• Authors: Teng Ye, Wei Ai, Lingyu Zhang, Ning Luo, Lulu Zhang, Jieping Ye, Qiaozhu Mei
• Abstract summary: We analyze data collected from more than 500 large-scale team competitions organized by a leading ride-sharing platform. Through a careful investigation of features and predictors, we are able to reduce out-sample prediction error by more than 24%. A simulated analysis shows that by simply changing a few contest design options, the average treatment effect of a real competition is expected to increase by as much as 26%.
• Score: 47.47879093076968
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Millions of drivers worldwide have enjoyed financial benefits and work schedule flexibility through a ride-sharing economy, but meanwhile they have suffered from the lack of a sense of identity and career achievement. Equipped with social identity and contest theories, financially incentivized team competitions have been an effective instrument to increase drivers' productivity, job satisfaction, and retention, and to improve revenue over cost for ride-sharing platforms. While these competitions are overall effective, the decisive factors behind the treatment effects and how they affect the outcomes of individual drivers have been largely mysterious. In this study, we analyze data collected from more than 500 large-scale team competitions organized by a leading ride-sharing platform, building machine learning models to predict individual treatment effects. Through a careful investigation of features and predictors, we are able to reduce out-sample prediction error by more than 24%. Through interpreting the best-performing models, we discover many novel and actionable insights regarding how to optimize the design and the execution of team competitions on ride-sharing platforms. A simulated analysis demonstrates that by simply changing a few contest design options, the average treatment effect of a real competition is expected to increase by as much as 26%. Our procedure and findings shed light on how to analyze and optimize large-scale online field experiments in general.

Related papers

• Reduced-Rank Multi-objective Policy Learning and Optimization [57.978477569678844]
  In practice, causal researchers do not have a single outcome in mind a priori. In government-assisted social benefit programs, policymakers collect many outcomes to understand the multidimensional nature of poverty. We present a data-driven dimensionality-reduction methodology for multiple outcomes in the context of optimal policy learning.
  arXiv  Detail & Related papers  (2024-04-29T08:16:30Z)
• CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition [52.2034494666179]
  Sparse mixture of experts (SMoE) offers an appealing solution to scale up the model complexity beyond the mean of increasing the network's depth or width. We propose a competition mechanism to address this fundamental challenge of representation collapse. By routing inputs only to experts with the highest neural response, we show that, under mild assumptions, competition enjoys the same convergence rate as the optimal estimator.
  arXiv  Detail & Related papers  (2024-02-04T15:17:09Z)
• An Integrated Framework for Team Formation and Winner Prediction in the FIRST Robotics Competition: Model, Algorithm, and Analysis [0.0]
  We apply our method to the drafting process of the FIRST Robotics competition. First, we develop a method that could extrapolate individual members' performance based on overall team performance. An alliance optimization algorithm is developed to optimize team formation and a deep neural network model is trained to predict the winning team.
  arXiv  Detail & Related papers  (2024-01-06T23:11:50Z)
• Improved Bayes Risk Can Yield Reduced Social Welfare Under Competition [99.7047087527422]
  In this work, we demonstrate that competition can fundamentally alter the behavior of machine learning scaling trends. We find many settings where improving data representation quality decreases the overall predictive accuracy across users. At a conceptual level, our work suggests that favorable scaling trends for individual model-providers need not translate to downstream improvements in social welfare.
  arXiv  Detail & Related papers  (2023-06-26T13:06:34Z)
• Strategic Data Sharing between Competitors [4.8951183832371]
  We introduce a general framework for analyzing this data-sharing trade-off. We study an instantiation of the framework, based on a conventional market model from economic theory. Our findings indicate a profound impact of market conditions on the data-sharing incentives.
  arXiv  Detail & Related papers  (2023-05-25T13:34:12Z)
• Cascaded Debiasing: Studying the Cumulative Effect of Multiple Fairness-Enhancing Interventions [48.98659895355356]
  This paper investigates the cumulative effect of multiple fairness enhancing interventions at different stages of the machine learning (ML) pipeline. Applying multiple interventions results in better fairness and lower utility than individual interventions on aggregate. On the downside, fairness-enhancing interventions can negatively impact different population groups, especially the privileged group.
  arXiv  Detail & Related papers  (2022-02-08T09:20:58Z)
• Interpretable Multiple Treatment Revenue Uplift Modeling [4.9571232160914365]
  Uplift models support a firm's decision-making by predicting the change of a customer's behavior due to a treatment. The paper extends corresponding approaches by developing uplift models for multiple treatments and continuous outcomes.
  arXiv  Detail & Related papers  (2021-01-09T11:29:00Z)
• Trading the System Efficiency for the Income Equality of Drivers in Rideshare [23.53645438932742]
  We study the income inequality among rideshare drivers due to discriminative cancellations from riders. We propose an online bipartite-matching model where riders are assumed to arrive sequentially following a distribution known in advance.
  arXiv  Detail & Related papers  (2020-12-12T16:04:06Z)
• Kaggle forecasting competitions: An overlooked learning opportunity [0.0]
  We review the results from six Kaggle competitions featuring real-life business forecasting tasks. We find that most of the Kaggle datasets are characterized by higher intermittence and entropy than the M-competitions. We find the strong performance of gradient boosted decision trees, increasing success of neural networks for forecasting, and a variety of techniques for adapting machine learning models to the forecasting task.
  arXiv  Detail & Related papers  (2020-09-16T14:14:41Z)
• Competing Bandits: The Perils of Exploration Under Competition [99.68537519404727]
  We study the interplay between exploration and competition on online platforms. We find that stark competition induces firms to commit to a "greedy" bandit algorithm that leads to low welfare. We investigate two channels for weakening the competition: relaxing the rationality of users and giving one firm a first-mover advantage.
  arXiv  Detail & Related papers  (2020-07-20T14:19:08Z)

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.