Measured aggregate productivity and the income share of top earners are strongly and positively correlated in the Canadian data. Productivity slowdown since the early 2000s was accompanied with a flattening income share of top earners. Motivated by these facts, we study the role of firms' top-paid workers and worker matching in accounting for the slowdown of measured total factor productivity. We first estimate total factor productivity for Canadian firms in the period of 2003-2015, taking into account the assortative matching between top workers and non-top workers. Measured total factor productivity consists of the Hicks-neutral technology and the quality of top workers. Our estimation suggests that measured aggregate total factor productivity declined from 2003 to 2015, in line with that estimated by the statistical agency. The decline of measured productivity is entirely accounted for by the declining quality of top workers, while the Hicks-neutral technology improved. Both the within-firm changes and the cross-firm reallocation of top-worker quality are important in contributing to the decline of overall top-worker quality. We also discuss possible causes of declines in the qu
Over the past decade, Big Tech has faced increasing levels of worker activism. While worker actions have resulted in positive outcomes (e.g., cancellation of Google's Project Dragonfly), such successes have become increasingly infrequent. This is, in part, because corporations have adjusted their strategies to dealing with increased worker activism (e.g., increased retaliation against workers, and contracts clauses that prevent cancellation due to worker pressure). This change in company strategy prompts urgent questions about updating worker strategies for influencing corporate behavior in an industry with vast societal impact. Current discourse on tech worker activism often lacks empirical grounding regarding its scope, history, and strategic calculus. Our work seeks to bridge this gap by firstly conducting a systematic analysis of worker actions at Google and Microsoft reported in U.S. newspapers to delineate their characteristics. We then situate these actions within the long history of labour movements and demonstrate that, despite perceptions of radicalism, contemporary tech activism is comparatively moderate. Finally, we engage directly with current and former tech activists
AI expansion has accelerated workplace adoption of new technologies. Yet, it is unclear whether and how knowledge workers are supported and trained to safely use AI. Inadequate training may lead to unrealized benefits if workers abandon tools, or perpetuate biases if workers misinterpret AI-based outcomes. In a workshop with 39 workers from 26 countries specializing in human resources, labor law, standards creation, and worker training, we explored questions and ideas they had about safely adopting AI. We held 17 follow-up interviews to further investigate what skills and training knowledge workers need to achieve safe and effective AI in practice. We synthesize nine training topics participants surfaced for knowledge workers related to challenges around understanding what AI is, misinterpreting outcomes, exacerbating biases, and worker rights. We reflect how these training topics might be addressed under different contexts, imagine HCI research prototypes as potential training tools, and consider ways to ensure training does not perpetuate harmful values.
We consider the problem of assigning tasks efficiently to a set of workers that can exhaust themselves as a result of processing tasks. If a worker is exhausted, it will take a longer time to recover. To model efficiency of workers with exhaustion, we use a continuous-time Markov chain (CTMC). By taking samples from the internal states of the workers, the source assigns tasks to the workers when they are found to be in their efficient states. We consider two different settings where (i) the source can assign tasks to the workers only when they are in their most efficient state, and (ii) it can assign tasks to workers when they are also moderately efficient in spite of a potentially reduced success probability. In the former case, we find the optimal policy to be a threshold-based sampling policy where the thresholds depend on the workers' recovery and exhaustion rates. In the latter case, we solve a non-convex sum-of-ratios problem using a branch-and-bound approach which performs well compared with the globally optimal solution.
In crowdsourcing systems, requesters publish tasks, and interested workers provide answers to get rewards. Worker anonymity motivates participation since it protects their privacy. Anonymity with unlinkability is an enhanced version of anonymity because it makes it impossible to ``link'' workers across the tasks they participate in. Another core feature of crowdsourcing systems is worker quality which expresses a worker's trustworthiness and quantifies their historical performance. Notably, worker quality depends on the participation history, revealing information about it, while unlinkability aims to disassociate the workers' identities from their past activity. In this work, we present AVeCQ, the first crowdsourcing system that reconciles these properties, achieving enhanced anonymity and verifiable worker quality updates. AVeCQ relies on a suite of cryptographic tools, such as zero-knowledge proofs, to (i) guarantee workers' privacy, (ii) prove the correctness of worker quality scores and task answers, and (iii) commensurate payments. AVeCQ is developed modularly, where the requesters and workers communicate over a platform that supports pseudonymity, information logging, and pa
This paper addresses the scheduling problem for unrelated crowd workers in mobile social networks, where the required service time for each task varies among the assigned crowd workers. The goal is to minimize the total weighted completion time of all tasks. First, in an environment with identical crowd workers, we improve the approximation ratio of the Largest-Ratio-First (LRF) scheduling algorithm and provide an updated competitive ratio for its online version. Next, for the unrelated crowd workers environment, we introduce a randomized approximation algorithm that achieves an expected approximation ratio of 1.45. This result improves upon the 1.5-approximation ratio reported in our previous work. We also present a derandomization method for this algorithm. Furthermore, to improve computational efficiency, we propose an algorithm that leverages the property that the optimal schedule on a single crowd worker arranges tasks in non-increasing order by their Smith ratios. Experimental results demonstrate that our proposed method outperforms three variants of the LRF algorithm.
Across service domains, platform-based gig workers often face a wide range of severe yet hidden vulnerabilities, including opaque pay practices, illusions of flexibility, health and safety risks, and privacy violations. To the general public and inexperienced workers such latent vulnerabilities remain largely unknown and concealed by intentional platform design that gives illusions of adequate labor protections, or $\textit{myths}$. This study examines how workers perceive (and shift their beliefs away from) five commonly held misconceptions regarding gig worker vulnerabilities. In $Phase~I$, crowdworkers ($N~=~236$) rated their agreement with five common myths surrounding vulnerabilities in gig work:$~227$ of them believed one or more myth(s). In $Phase~II$, we challenged these workers to defend their views by presenting an expert- or LLM-generated counterargument. Our findings show workers' underexposure to personal and shared vulnerabilities of gig work, revealing a knowledge gap where persuasive interventions can scalably raise awareness around such hidden labor conditions. We reflect on the effectiveness of different persuasion strategies and discuss implications for promoting
Deep neural network training often exhibits highly anisotropic loss geometry, where a few sharp dominant Hessian directions coexist with a large flatter bulk. Gradients tend to align disproportionately with these dominant directions, although stable progress often requires movement through flatter bulk directions. Estimating the dominant subspace is therefore useful but costly with direct Hessian-based methods. We show that standard Local SGD exposes this geometry through worker disagreement. We theoretically show that the worker-average gap covariance is shaped by stochastic-gradient noise and Hessian curvature, causing workers to disagree along sharp, curvature-sensitive directions. Thus, worker-average gaps provide a cheap Hessian-free estimator of the dominant subspace. Experiments on MLPs, CNNs, and Transformers show that subspaces formed by worker-average gaps capture a substantial fraction of the gradient component lying in the dominant Hessian eigenspace.
Annotation through crowdsourcing draws incremental attention, which relies on an effective selection scheme given a pool of workers. Existing methods propose to select workers based on their performance on tasks with ground truth, while two important points are missed. 1) The historical performances of workers in other tasks. In real-world scenarios, workers need to solve a new task whose correlation with previous tasks is not well-known before the training, which is called cross-domain. 2) The dynamic worker performance as workers will learn from the ground truth. In this paper, we consider both factors in designing an allocation scheme named cross-domain-aware worker selection with training approach. Our approach proposes two estimation modules to both statistically analyze the cross-domain correlation and simulate the learning gain of workers dynamically. A framework with a theoretical analysis of the worker elimination process is given. To validate the effectiveness of our methods, we collect two novel real-world datasets and generate synthetic datasets. The experiment results show that our method outperforms the baselines on both real-world and synthetic datasets.
With the rapid advancement of mobile networks and the widespread use of mobile devices, spatial crowdsourcing, which involves assigning location-based tasks to mobile workers, has gained significant attention. However, most existing research focuses on task assignment at the current moment, overlooking the fluctuating demand and supply between tasks and workers over time. To address this issue, we introduce an adaptive task assignment problem, which aims to maximize the number of assigned tasks by dynamically adjusting task assignments in response to changing demand and supply. We develop a spatial crowdsourcing framework, namely demand-based adaptive task assignment with dynamic worker availability windows, which consists of two components including task demand prediction and task assignment. In the first component, we construct a graph adjacency matrix representing the demand dependency relationships in different regions and employ a multivariate time series learning approach to predict future task demands. In the task assignment component, we adjust tasks to workers based on these predictions, worker availability windows, and the current task assignments, where each worker has a
Workers recruitment remains a significant issue in Mobile Crowdsourcing (MCS), where the aim is to recruit a group of workers that maximizes the expected Quality of Service (QoS). Current recruitment systems assume that a pre-defined pool of workers is available. However, this assumption is not always true, especially in cold-start situations, where a new MCS task has just been released. Additionally, studies show that up to 96\% of the available candidates are usually not willing to perform the assigned tasks. To tackle these issues, recent works use Online Social Networks (OSNs) and Influence Maximization (IM) to advertise about the desired MCS tasks through influencers, aiming to build larger pools. However, these works suffer from several limitations, such as 1) the lack of group-based selection methods when choosing influencers, 2) the lack of a well-defined worker recruitment process following IM, 3) and the non-dynamicity of the recruitment process, where the workers who refuse to perform the task are not substituted. In this paper, an Influence- and Interest-based Worker Recruitment System (IIWRS), using OSNs, is proposed. The proposed system has two main components: 1) an
The proliferating adoption of platform-based gig work increasingly raises concerns for worker conditions. Past studies documented how platforms leveraged design to exploit labor, withheld information to generate power asymmetries, and left workers alone to manage logistical overheads as well as social isolation. However, researchers also called attention to the potential of helping workers overcome such costs via worker-led datasharing, which can enable collective actions and mutual aid among workers, while offering advocates, lawmakers and regulatory bodies insights for improving work conditions. To understand stakeholders' desiderata for a data-sharing system (i.e. functionality and policy initiatives that it can serve), we interviewed 11 policy domain experts in the U.S. and conducted co-design workshops with 14 active gig workers across four domains. Our results outline policymakers' prioritized initiatives, information needs, and (mis)alignments with workers' concerns and desires around data collectives. We offer design recommendations for data-sharing systems that support worker needs while bringing us closer to legislation that promote more thriving and equitable gig work fu
Information about peers' performance is pervasive in workplaces, yet its effects on worker behavior are mixed. We show that a key reason is that workers differ in how they value such information. In a real-effort experiment with 793 workers, we elicit willingness-to-pay for peer information delivered either before or after the task. We document substantial heterogeneity in demand for peer information: some workers are indifferent, some prefer to avoid it before the task, and others value it more as their relative performance increases. These differences strongly predict effort responses to peer information. Notably, 15% of workers would pay to avoid information ex ante due to stress and exhibit no productivity gains from it. We further show that uniform feedback policies can impose welfare losses on such workers, while tailoring the timing of peer information increases welfare by up to 48%. Our results highlight the importance of accounting for heterogeneous information preferences when designing workplace feedback policies.
The success of software crowdsourcing depends on active and trustworthy pool of worker supply. The uncertainty of crowd workers' behaviors makes it challenging to predict workers' success and plan accordingly. In a competitive crowdsourcing marketplace, competition for success over shared tasks adds another layer of uncertainty in crowd workers' decision-making process. Preliminary analysis on software worker behaviors reveals an alarming task dropping rate of 82.9%. These factors lead to the need for an automated recommendation system for CSD workers to improve the visibility and predictability of their success in the competition. To that end, this paper proposes a collaborative recommendation system for crowd workers. The proposed recommendation system method uses five input metrics based on workers' collaboration history in the pool, workers' preferences in taking tasks in terms of monetary prize and duration, workers' specialty, and workers' proficiency. The proposed method then recommends the most suitable tasks for a worker to compete on based on workers' probability of success in the task. Experimental results on 260 active crowd workers demonstrate that just following the t
Current practices regarding data collection for natural language processing on Amazon Mechanical Turk (MTurk) often rely on a combination of studies on data quality and heuristics shared among NLP researchers. However, without considering the perspectives of MTurk workers, these approaches are susceptible to issues regarding workers' rights and poor response quality. We conducted a critical literature review and a survey of MTurk workers aimed at addressing open questions regarding best practices for fair payment, worker privacy, data quality, and considering worker incentives. We found that worker preferences are often at odds with received wisdom among NLP researchers. Surveyed workers preferred reliable, reasonable payments over uncertain, very high payments; reported frequently lying on demographic questions; and expressed frustration at having work rejected with no explanation. We also found that workers view some quality control methods, such as requiring minimum response times or Master's qualifications, as biased and largely ineffective. Based on the survey results, we provide recommendations on how future NLP studies may better account for MTurk workers' experiences in ord
Rideshare platforms exert significant control over workers through algorithmic systems that can result in financial, emotional, and physical harm. What steps can platforms, designers, and practitioners take to mitigate these negative impacts and meet worker needs? In this paper, we identify transparency-related harms, mitigation strategies, and worker needs while validating and contextualizing our findings within the broader worker community. We use a novel mixed-methods study combining an LLM-based analysis of over 1 million comments posted to online platform worker communities with semi-structured interviews with workers. Our findings expose a transparency gap between existing platform designs and the information drivers need, particularly concerning promotions, fares, routes, and task allocation. Our analysis suggests that rideshare workers need key pieces of information, which we refer to as indicators, to make informed work decisions. These indicators include details about rides, driver statistics, algorithmic implementation details, and platform policy information. We argue that instead of relying on platforms to include such information in their designs, new regulations requ
The AKM model introduced by Abowd, Kramarz and Margolis (1999) has become a workhorse to study worker and firm heterogeneity, and to understand the sources of wage dispersion in the labor market using linked employer-employee data. In this article, we introduce the model and estimator, discuss some best practices for estimation, and review some empirical findings on the role of worker and firm heterogeneity in wage dispersion. While the AKM methodology has proven useful to analyze a host of questions in a variety of settings within labor economics and beyond, we also point to the need for methodological developments.
We propose a new approach to estimate government worker skills, a setting where output is hard to observe and wages may be uninformative about skills. The approach uses wages in comparable jobs in the private sector and machine learning tools to link skills to skill-related observables. We apply the approach to rich Indonesian household-level panel data from 1988-2014, showing two main applications. First, government skills have continuously declined relative to the private sector, driven by the most skilled workers ending up in the private sector. Second, the Indonesian government pays a wage premium of 43% conditional on skills.
Crowdsourcing is an online outsourcing mode which can solve the current machine learning algorithm's urge need for massive labeled data. Requester posts tasks on crowdsourcing platforms, which employ online workers over the Internet to complete tasks, then aggregate and return results to requester. How to model the interaction between different types of workers and tasks is a hot spot. In this paper, we try to model workers as four types based on their ability: expert, normal worker, sloppy worker and spammer, and divide tasks into hard, medium and easy task according to their difficulty. We believe that even experts struggle with difficult tasks while sloppy workers can get easy tasks right, and spammers always give out wrong answers deliberately. So, good examination tasks should have moderate degree of difficulty and discriminability to score workers more objectively. Thus, we first score workers' ability mainly on the medium difficult tasks, then reducing the weight of answers from sloppy workers and modifying the answers from spammers when inferring the tasks' ground truth. A probability graph model is adopted to simulate the task execution process, and an iterative method is
This paper considers the optimal management structure about hiring a manager and providing the manager with a separate salary and bonus using a relational contract among an owner, a manager, and workers, assuming that the manager can observe individual worker performances while the owner can observe only overall team performance. I derive optimal contracts for the two cases in which the manage's salary and bonus are integrated into total team bonus or provided separately. I compare situations of having the manager distribute bonuses based on individual worker performance to the situation of equal bonus distribution based on overall team performance without a manager. Only a contract with a manager who receives a separate bonus is feasible for low discount factor. Making the manager to distribute the salary and bonus including himself is best with intermediate discount factor. Providing an equal bonus without a manager is optimal with high discount factor.