Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Synergistic team composition: A computational approach to foster diversity in teams

  • Andrejczuk, Ewa
  • Bistaffa, Filippo
  • Blum, Christian
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
Co-operative learning in heterogeneous teams refers to learning methods in which teams are organised both to accomplish academic tasks and for individuals to gain knowledge. Competencies, personality and the gender of team members are key factors that influence team performance. Here, we introduce a team composition problem, the so-called synergistic team composition problem (STCP), which incorporates such key factors when arranging teams. Thus, the goal of the STCP is to partition a set of individuals into a set of synergistic teams: teams that are diverse in personality and gender and whose members cover all required competencies to complete a task. Furthermore, the STCP requires that all teams are balanced in that they are expected to exhibit similar performances when completing the task. We propose two efficient algorithms to solve the STCP. Our first algorithm is based on a linear programming formulation and is appropriate to solve small instances of the problem. Our second algorithm is an anytime heuristic that is effective for large instances of the STCP. Finally, we thoroughly study the computational properties of both algorithms in an educational context when grouping students in a classroom into teams using actual-world data., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A COP Model For Graph-Constrained Coalition Formation

  • Bistaffa, Filippo
  • Farinelli, Alessandro
We consider Graph-Constrained Coalition Formation (GCCF), a widely studied subproblem of coalition formation in which the set of valid coalitions is restricted by a graph. We propose COP-GCCF, a novel approach that models GCCF as a COP, and we solve such COP with a highly-parallel approach based on Bucket Elimination executed on the GPU, which is able to exploit the high constraint tightness of COP-GCCF. Results show that our approach outperforms state of the art algorithms (i.e., DyCE and IDP^G) by at least one order of magnitude on realistic graphs, i.e., a crawl of the Twitter social graph, both in terms of runtime and memory., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

A Simulation Tool for Large-Scale Online Ridesharing

  • Bistaffa, Filippo
  • Rodríguez-Aguilar, Juan Antonio
  • Cerquides, Jesús
  • Blum, Christian
Ridesharing is a prominent collective intelligence application producing significant benefits both for individuals (reduced costs) and for the entire community (reduced pollution and traffic). We tackle the online ridesharing (ORS) problem with the objective of forming cost-effective shared rides among commuters that submit requests to be served in a short time period (i.e., in a few minutes). We demonstrate a web-based simulation tool that computes and shows cost-effective shared cars along with the optimal path for each car. Our tool internally employs an online optimisation approach that can tackle large-scale ORS problems originating from real-world data (i.e., with ~400 requests per minute). Specifically, our simulation tool uses data from a real-world dataset, i.e., the New York City taxi dataset., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Solving the Synergistic Team Composition Problem

  • Andrejczuk, Ewa
  • Bistaffa, Filippo
  • Blum, Christian
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
Co-operative learning is used to refer to learning procedures for heterogeneous teams in which individual and teamwork are organised to complete academic tasks. Key factors for team performance are competences, personality and team members' genders. Here, we present a computational model to form heterogeneous teams that incorporates those key factors. In addition, we propose efficient algorithms to partition a classroom into teams of even size and homogeneous performance. The first algorithm is based on an ILP formulation. For small problem instances this approach is appropriate. However, this is not the case for large problems, for which we propose a heuristic algorithm. We study the computational properties of both algorithms in the context of student teams., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers

  • Bistaffa, Filippo
  • Blum, Christian
  • Cerquides, Jesús
  • Farinelli, Alessandro
  • Rodríguez-Aguilar, Juan Antonio
Peer-to-peer ridesharing enables people to arrange one-time rides with their own private cars, without the involvement of professional drivers. It is a prominent collective intelligence application producing significant benefits both for individuals (reduced costs) and for the entire community (reduced pollution and traffic). Despite these very promising potential advantages, the percentage of users who currently adopt ridesharing solutions is very low, well below the adoption rate required to achieve said benefits. One of the reasons of this insufficient engagement by the public is the lack of effective incentive policies by regulatory authorities, who are not able to estimate the costs and the benefits of a given ridesharing adoption policy. Here we address these issues by (i) developing a novel algorithm that makes large-scale, real-time peer-topeer ridesharing technologically feasible; and (ii) exhaustively quantifying the impact of different ridesharing scenarios in terms of environmental benefits (i.e., reduction of CO2 emissions, noise pollution, and traffic congestion) and quality of service for the users. Our analysis on a real-world dataset shows that major societal benefits are expected from deploying peer-to-peer ridesharing depending on the trade-off between environmental benefits and quality of service. Results on a real-world dataset show that our approach can produce reductions up to a 70.78% in CO2 emissions and up to 80.08% in traffic congestion., Peer reviewed