Sequential Hiring of Contingent Workers Through Learning-Based Optimization

• URL: http://arxiv.org/abs/2606.18438v1
• Date: Tue, 16 Jun 2026 19:40:49 GMT
• Title: Sequential Hiring of Contingent Workers Through Learning-Based Optimization
• Abstract summary: We study a sequential workforce management problem in a contingent labor setting with uncertainty in both worker production and labor supply.<n>We develop a learning-based hiring policy, DR-UCB, that makes replacement and hiring decisions sequentially through learning cycles.<n>In each cycle, the policy uses real-time production data to determine when to initiate workforce changes and which workers to replace and hire.
• Score: 0.08496348835248901
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we study a sequential workforce management problem in a contingent labor setting with uncertainty in both worker production and labor supply. A firm seeks to maximize cumulative profit by maintaining an active team of fixed size while learning worker productivity over time. We emphasize two critical operational frictions in this problem: replacing workers is costly, and workers may not be available immediately for hiring because of, for example, prior job commitments, scheduling constraints, or onboarding procedures. Thus, hiring decisions take effect only after a random delay. We formulate this problem as a stochastic multi-play bandit with costly switching and delayed actions, and develop a learning-based hiring policy, DR-UCB (DelayedReplacement-UCB), that makes replacement and hiring decisions sequentially through learning cycles. In each cycle, the policy uses real-time production data to determine when to initiate workforce changes and which workers to replace and hire. We show that the leading-order regret of the proposed policy matches its lower bound in its dependence on the time horizon. Our numerical experiments show that DR-UCB outperforms benchmark policies.

Related papers

• RL Forgets! Towards Continual Policy Optimization [57.4336338996653]
  Continual post-training is becoming a central paradigm for adapting vision-language models to evolving tasks.<n>Recent work has increasingly favored reinforcement learning over supervised fine-tuning, driven by the belief that reinforcement learning is inherently less prone to forgetting.<n>We propose Continual Policy Optimization (CPO), a replay-free framework grounded in a prior-task behavioral KL objective.
  arXiv  Detail & Related papers  (2026-07-05T15:46:11Z)
• SkillChain-Gym: A Benchmark for Reskilling-Aware Production-Inventory Control under Disruptions [0.0]
  We introduce SkillChain-Gym, a benchmark specification for reskilling-aware production-inventory control.<n>The benchmark includes seed-controlled disruption scenarios, three feasibility modes with projection diagnostics, deterministic replay, and metrics.<n>We evaluate production-only, reactive adaptive, water-filling adaptive, and static-insurance policies with budget variants over 60-shift horizons.
  arXiv  Detail & Related papers  (2026-06-15T20:16:37Z)
• Test-Time Gradient Guidance of Flow Policies in Reinforcement Learning [50.738952715864116]
  Expressive continuous control policies form the backbone of advances in scaling imitation learning for simulated and real robot control.<n>We propose QGF (Q-Guided Flow), an RL algorithm that performs policy optimization entirely at test time.<n> Empirically, QGF outperforms prior test-time RL methods on single-task and goal-conditioned offline RL benchmarks.
  arXiv  Detail & Related papers  (2026-06-09T16:45:57Z)
• When Should a Robot Think? Resource-Aware Reasoning via Reinforcement Learning for Embodied Robotic Decision-Making [68.12864562049957]
  Embodied robotic systems increasingly rely on large language model (LLM)-based agents to support high-level reasoning.<n>This raises a fundamental question for embodied agents: when should the agent reason, and when should it act?<n>We propose RARRL (Resource-Aware Reasoning via Reinforcement Learning), a hierarchical framework for resource-aware orchestration of embodied agents.
  arXiv  Detail & Related papers  (2026-03-17T15:38:50Z)
• Budgeting Discretion: Theory and Evidence on Street-Level Decision-Making [10.816276884713611]
  We propose a principled model of how discretion should be rationed over time under real operational constraints.<n>We show that overrides follow a dynamic threshold rule: use discretion only when the opportunity exceeds a time and budget-dependent cutoff.<n>These results suggest that discretion can be both procedurally constrained and welfare-improving when treated as an explicitly budgeted resource.
  arXiv  Detail & Related papers  (2026-02-10T18:02:14Z)
• Can Online GenAI Discussion Serve as Bellwether for Labor Market Shifts? [62.386835769570006]
  This paper examines whether online discussions about Large Language Models can function as early indicators of labor market shifts.<n>We employ four distinct analytical approaches to identify the domains and timeframes in which public discourse serves as a leading signal for employment changes.<n>Our findings reveal that discussion intensity predicts employment changes 1-7 months in advance across multiple indicators, including job postings, net hiring rates, tenure patterns, and unemployment duration.
  arXiv  Detail & Related papers  (2025-11-20T04:18:25Z)
• Two Tickets are Better than One: Fair and Accurate Hiring Under Strategic LLM Manipulations [4.536082020644864]
  We introduce a new variant of the strategic classification framework tailored to manipulations performed using large language models.<n>We propose a two-ticket'' scheme, where the hiring algorithm applies an additional manipulation to each submitted resume.<n>We prove that hiring outcomes converge to a fixed, group-independent decision, eliminating disparities arising from differential access.
  arXiv  Detail & Related papers  (2025-02-18T19:01:04Z)
• FDPP: Fine-tune Diffusion Policy with Human Preference [57.44575105114056]
  Fine-tuning Diffusion Policy with Human Preference learns a reward function through preference-based learning.<n>This reward is then used to fine-tune the pre-trained policy with reinforcement learning.<n>Experiments demonstrate that FDPP effectively customizes policy behavior without compromising performance.
  arXiv  Detail & Related papers  (2025-01-14T17:15:27Z)
• Towards Robust Continual Learning with Bayesian Adaptive Moment Regularization [51.34904967046097]
  Continual learning seeks to overcome the challenge of catastrophic forgetting, where a model forgets previously learnt information. We introduce a novel prior-based method that better constrains parameter growth, reducing catastrophic forgetting. Results show that BAdam achieves state-of-the-art performance for prior-based methods on challenging single-headed class-incremental experiments.
  arXiv  Detail & Related papers  (2023-09-15T17:10:51Z)
• Keep Doing What Worked: Behavioral Modelling Priors for Offline Reinforcement Learning [25.099754758455415]
  Off-policy reinforcement learning algorithms promise to be applicable in settings where only a fixed data-set of environment interactions is available. Standard off-policy algorithms fail in the batch setting for continuous control.
  arXiv  Detail & Related papers  (2020-02-19T19:21:08Z)
• Algorithms for Hiring and Outsourcing in the Online Labor Market [12.893230873578878]
  We provide algorithms for outsourcing and hiring workers in a general setting. We call this model team formation with outsourcing. Our contribution is an efficient online cost-minimizing algorithm for hiring and firing team members and outsourcing tasks.
  arXiv  Detail & Related papers  (2020-02-16T18:56:26Z)
• Hierarchical Reinforcement Learning as a Model of Human Task Interleaving [60.95424607008241]
  We develop a hierarchical model of supervisory control driven by reinforcement learning. The model reproduces known empirical effects of task interleaving. The results support hierarchical RL as a plausible model of task interleaving.
  arXiv  Detail & Related papers  (2020-01-04T17:53:28Z)

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.