An attention model for the formation of collectives in real-world domains
Not on the map. Why?
Abstract (arXiv)
We consider the problem of forming collectives of agents for real-world applications aligned with Sustainable Development Goals (e.g., shared mobility, cooperative learning). We propose a general approach for the formation of collectives based on a novel combination of an attention model and an integer linear program (ILP). In more detail, we propose an attention encoder-decoder model that transforms a collective formation instance to a weighted set packing problem, which is then solved by an ILP. Results on two real-world domains (i.e., ridesharing and team formation for cooperative learning) show that our approach provides solutions that are comparable (in terms of quality) to the ones produced by state-of-the-art approaches specific to each domain. Moreover, our solution outperforms the most recent general approach for forming collectives based on Monte Carlo tree search.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 42 references that are in the map. First posted on arXiv 30 Apr 2022.
Builds on
11 of 42 references.
References · 11
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Layer Normalizationcited by 5,579
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2019Learning to Solve Large-Scale Security-Constrained Unit Commitment Problemscited by 38
- 2014Coalition Structure Generation over Graphscited by 5
- 2019Synergistic Team Composition: A Computational Approach to Foster Diversity in Teamscited by 3
- 2022The First AI4TSP Competition: Learning to Solve Stochastic Routing Problemscited by 3
- 2016Algorithms for Graph-Constrained Coalition Formation in the Real Worldcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.