A QUBO Framework for Team Formation

• URL: http://arxiv.org/abs/2503.23209v1
• Date: Sat, 29 Mar 2025 20:18:46 GMT
• Title: A QUBO Framework for Team Formation
• Authors: Karan Vombatkere, Evimaria Terzi, Theodoros Lappas,
• Abstract summary: We introduce the unified TeamFormation formulation that captures all cost definitions for team formation problems.<n>We show that solutions based on the QUBO formulations of TeamFormation problems are at least as good as those produced by established baselines.
• Score: 4.75871395031396
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The team formation problem assumes a set of experts and a task, where each expert has a set of skills and the task requires some skills. The objective is to find a set of experts that maximizes coverage of the required skills while simultaneously minimizing the costs associated with the experts. Different definitions of cost have traditionally led to distinct problem formulations and algorithmic solutions. We introduce the unified TeamFormation formulation that captures all cost definitions for team formation problems that balance task coverage and expert cost. Specifically, we formulate three TeamFormation variants with different cost functions using quadratic unconstrained binary optimization (QUBO), and we evaluate two distinct general-purpose solution methods. We show that solutions based on the QUBO formulations of TeamFormation problems are at least as good as those produced by established baselines. Furthermore, we show that QUBO-based solutions leveraging graph neural networks can effectively learn representations of experts and skills to enable transfer learning, allowing node embeddings from one problem instance to be efficiently applied to another.

Related papers

• A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems [6.046591474843391]
  Learn-to-Defer is a paradigm that enables learning algorithms to work not in isolation but as a team with human experts. In this paper, we obtain the Bayes optimal solution for learn-to-defer systems under various constraints. Our algorithm shows improvements in terms of constraint violation over a set of baselines.
  arXiv  Detail & Related papers  (2024-07-17T16:32:30Z)
• Learning Task Decomposition to Assist Humans in Competitive Programming [90.4846613669734]
  We introduce a novel objective for learning task decomposition, termed value (AssistV)<n>We collect a dataset of human repair experiences on different decomposed solutions.<n>Under 177 hours of human study, our method enables non-experts to solve 33.3% more problems, speeds them up by 3.3x, and empowers them to match unassisted experts.
  arXiv  Detail & Related papers  (2024-06-07T03:27:51Z)
• Active Ranking of Experts Based on their Performances in Many Tasks [72.96112117037465]
  We consider the problem of ranking n experts based on their performances on d tasks. We make a monotonicity assumption stating that for each pair of experts, one outperforms the other on all tasks.
  arXiv  Detail & Related papers  (2023-06-05T06:55:39Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team Members [13.643650155415484]
  We show how cooperative game-theoretic solutions can be distilled into a learned model by training neural networks. Our approach creates models that can generalize to games far from the training distribution. An important application of our framework is Explainable AI.
  arXiv  Detail & Related papers  (2022-08-18T12:33:09Z)
• Multi-Agent Neural Rewriter for Vehicle Routing with Limited Disclosure of Costs [65.23158435596518]
  Solving the multi-vehicle routing problem as a team Markov game with partially observable costs. Our multi-agent reinforcement learning approach, the so-called multi-agent Neural Rewriter, builds on the single-agent Neural Rewriter to solve the problem by iteratively rewriting solutions.
  arXiv  Detail & Related papers  (2022-06-13T09:17:40Z)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• Towards Collaborative Question Answering: A Preliminary Study [63.91687114660126]
  We propose CollabQA, a novel QA task in which several expert agents coordinated by a moderator work together to answer questions that cannot be answered with any single agent alone. We make a synthetic dataset of a large knowledge graph that can be distributed to experts. We show that the problem can be challenging without introducing prior to the collaboration structure, unless experts are perfect and uniform.
  arXiv  Detail & Related papers  (2022-01-24T14:27:00Z)
• Finding teams that balance expert load and task coverage [7.831410227443101]
  In this paper we consider a problem where each task consists of required and optional skills. We show that the BalancedTA problem (and its variant) is NP-hard and design efficients for solving it in practice.
  arXiv  Detail & Related papers  (2020-11-03T18:04:15Z)
• Specialization in Hierarchical Learning Systems [0.0]
  We investigate in how far information constraints in hierarchies of experts not only provide a principled method for regularization but also to enforce specialization. We devise an information-theoretically motivated on-line learning rule that allows partitioning of the problem space into multiple sub-problems that can be solved by the individual experts. We show the broad applicability of our approach on a range of problems including classification, regression, density estimation, and reinforcement learning problems.
  arXiv  Detail & Related papers  (2020-11-03T17:00:31Z)
• TAIP: an anytime algorithm for allocating student teams to internship programs [0.0]
  We focus on the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. We propose TAIP, a algorithm that generates an initial team allocation which later on attempts to improve in an iterative process.
  arXiv  Detail & Related papers  (2020-05-19T09:50:38Z)

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.