HPA4CF
HPA4CF

HPA4CF
HPA4CF
 : 
Collectiveware: Highly-parallel algorithms for collective intelligence
Collectiveware: Highly-parallel algorithms for collective intelligence

A Project coordinated by IIIA.

Web page:

https://filippobistaffa.github.io/HPA4CF/index.html

Principal investigator: 

Juan A. Rodríguez-Aguilar

Collaborating organisations:

Funding entity:

European Commission
European Commission

Funding call:

Funding call URL:

https://ec.europa.eu/research/participants/portal/desktop/en/opportunities/h2020/topics/msca-if-2016.html

Project #:

HPA4CF
HPA4CF

Total funding amount:

158.121,00€
158.121,00€

IIIA funding amount:

Duration:

16/Jun/2017
16/Jun/2017
- 
15/Jun/2019
15/Jun/2019

Extension date:

In recent years, more and more scenarios pose challenges that require collective intelligence solutions based on networks (knowledge networks, social networks, sensor networks). New forms of collaborative consumption, collaborative making, collaborative production, all rely on a common task, the formation of collectives. This task is crucial in many real-world applications domains. Notable examples of actual-world collective formation scenarios are Collective Energy Purchasing (CEP), a collaborative consumption scenario, and Team Formation (TF), a collaborative production scenario. Within the Artificial Intelligence literature, current state of the art algorithms cannot provide the level of scalability and the solution quality required by actual-world collective formation problems, hence novel algorithms are needed to tackle these problems. To achieve this objective, we aim at proposing novel algorithms that are capable to exploit modern highly-parallel architectures. On the one hand, highly-parallel architectures have been successfully applied in many different scenarios so to achieve tremendous performance improvements. These advancements encourage the investigation of parallelisation also in collective formation, with the objective of achieving the same benefits. On the other hand, our past research indicates that considering the structure of the collective formation problem leads to notable benefits in terms of scalability and solution quality. Thus, we propose to take a novel algorithmic design approach that considers both the structure of the scenario and at the same time exploits modern highly-parallel architectures. Our algorithms will be evaluated in two prominent collective intelligence application domains: the CEP and TF domains. The choice of these two application domains will serve to show the generality of our algorithmic design approach, since they are representative of two structurally different families of actualworld collective formation problems.
In recent years, more and more scenarios pose challenges that require collective intelligence solutions based on networks (knowledge networks, social networks, sensor networks). New forms of collaborative consumption, collaborative making, collaborative production, all rely on a common task, the formation of collectives. This task is crucial in many real-world applications domains. Notable examples of actual-world collective formation scenarios are Collective Energy Purchasing (CEP), a collaborative consumption scenario, and Team Formation (TF), a collaborative production scenario. Within the Artificial Intelligence literature, current state of the art algorithms cannot provide the level of scalability and the solution quality required by actual-world collective formation problems, hence novel algorithms are needed to tackle these problems. To achieve this objective, we aim at proposing novel algorithms that are capable to exploit modern highly-parallel architectures. On the one hand, highly-parallel architectures have been successfully applied in many different scenarios so to achieve tremendous performance improvements. These advancements encourage the investigation of parallelisation also in collective formation, with the objective of achieving the same benefits. On the other hand, our past research indicates that considering the structure of the collective formation problem leads to notable benefits in terms of scalability and solution quality. Thus, we propose to take a novel algorithmic design approach that considers both the structure of the scenario and at the same time exploits modern highly-parallel architectures. Our algorithms will be evaluated in two prominent collective intelligence application domains: the CEP and TF domains. The choice of these two application domains will serve to show the generality of our algorithmic design approach, since they are representative of two structurally different families of actualworld collective formation problems.
2022
Filippo Bistaffa,  Georgios Chalkiadakis,  & Alessandro Farinelli (2022). Efficient Coalition Structure Generation via Approximately Equivalent Induced Subgraph Games. IEEE Transactions on Cybernetics, 52, 5548-5558. https://doi.org/10.1109/TCYB.2020.3040622. [BibTeX]  [PDF]
2021
Filippo Bistaffa,  Christian Blum,  Jesús Cerquides,  Alessandro Farinelli,  & Juan A. Rodríguez-Aguilar (2021). A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers. IEEE Transactions on Intelligent Transportation Systems, 22, 119-130. https://doi.org/10.1109/TITS.2019.2954982. [BibTeX]  [PDF]
2020
Filippo Bistaffa,  Juan A. Rodríguez-Aguilar,  & Jesús Cerquides (2020). Predicting Requests in Large-Scale Online P2P Ridesharing. arXiv preprint arXiv:2009.02997. [BibTeX]  [PDF]
2018
Filippo Bistaffa,  & Alessandro Farinelli (2018). A COP Model For Graph-Constrained Coalition Formation. Journal of Artificial Intelligence Research, 62, 133-153. https://doi.org/10.1613/jair.1.11205. [BibTeX]
Filippo Bistaffa,  & Alessandro Farinelli (2018). A COP Model for Graph-Constrained Coalition Formation (Extended Abstract). International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018) (pp. 5553-5557). AAAI Press. https://doi.org/10.24963/ijcai.2018/783. [BibTeX]  [PDF]
Filippo Bistaffa,  Juan A. Rodríguez-Aguilar,  Jesús Cerquides,  & Christian Blum (2018). A Simulation Tool for Large-Scale Online Ridesharing (Demonstration). International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018) (pp. 1797-1799). IFAAMAS. https://doi.org/https://dl.acm.org/citation.cfm?id=3237981. [BibTeX]
Ewa Andrejczuk,  Filippo Bistaffa,  Christian Blum,  Juan A. Rodríguez-Aguilar,  & Carles Sierra (2018). Solving the Synergistic Team Formation Problem. Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018) (pp. 1853-1855). IFAAMAS. [BibTeX]
2017
Filippo Bistaffa,  Alessandro Farinelli,  Georgios Chalkiadakis,  & Sarvapali D. Ramchurn (2017). A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem. Artificial Intelligence, 246, 86-117. https://doi.org/10.1016/j.artint.2017.02.004. [BibTeX]
Filippo Bistaffa
Tenured Scientist
Phone Ext. 431849

Jesus Cerquides
Scientific Researcher
Phone Ext. 431859

Juan A. Rodríguez-Aguilar
Research Professor
Phone Ext. 431861

IIIA-CSIC. CAMPUS DE LA UAB, E-08193. BELLATERRA, CATALONIA (SPAIN)
Phone. (+34) 93 580 9570 − Fax.  (+34) 93 580 9661
© 2020 IIIA | All Rights reserved
Privacy Policy | Cookie Policy