Pasar al contenido principal

COLLECTIVEWARE: TECNOLOGIAS PARA POTENCIAR COLECTIVOS HUMANOS EN LA RED ELECTRICA INTELIGENTE

TIN2015-66863-C2-1-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Dirección General de Investigación Científica y Técnica
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the use of multiple criteria distance indexes to find robust cash management policies

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Rodriguez-Aguilar, Juan A.
[EN] Cash management decision-making can be handled from a multiobjective perspective by optimizing not only cost but also risk. Nevertheless, choosing the best policies under a changing context is by no means straightforward. To this end, we rely on compromise programming to incorporate robustness as an additional goal to cost and risk within a multiobjective framework. As a result, we propose to calculate robustness as a multiple criteria distance index that is able to identify the best compromise policies in terms of cost and risk. Such policies are also robust to cash flow regime changes. We show its utility by transforming the Miller and Orr s cash management model into its robust counterpart using real data from an industrial company., Ministerio de Economia y Competitividad [grant number Collectiveware TIN2015-66863-C2-1-R], [grant number 2014 SGR 118]. Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Characterizing compromise solutions for investors with uncertain risk preferences

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Rodriguez-Aguilar, Juan A.
[EN] The optimum portfolio selection for an investor with particular preferences was proven to lie on the normalized efficient frontier between two bounds defined by the Ballestero (1998) bounding theorem. A deeper understanding is possible if the decision-maker is provided with visual and quantitative techniques. Here, we derive useful insights as a way to support investor's decision-making through: (i) a new theorem to assess balance of solutions; (ii) a procedure and a new plot to deal with discrete efficient frontiers and uncertain risk preferences; and (iii) two quality metrics useful to predict long-run performance of investors., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A multi-objective approach to the cash management problem

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Rodriguez Aguilar, Juan Antonio
[EN] Cash management is concerned with optimizing costs of short-term cash policies of a company. Different optimization models have been proposed in the literature whose focus has been only placed on a single objective, namely, on minimizing costs. However, cash managers may also be interested in risk associated to cash policies. In this paper, we propose a multi-objective cash management model based on compromise programming that allows cash managers to select the best policies, in terms of cost and risk, according to their risk preferences. The model is illustrated through several examples using real data from an industrial company, alternative cost scenarios and two different measures of risk. As a result, we provide cash managers with a new tool to allow them deciding on the level of risk to take in daily decision-making., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Selecting cash management models from a multiobjective perspective

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Díaz-García, Pablo|||0000-0002-7093-6061
  • Rodríguez-Aguilar, Juan A.
[EN] This paper addresses the problem of selecting cash management models under different operating conditions from a multiobjective perspective considering not only cost but also risk. A number of models have been proposed to optimize corporate cash management policies. The impact on model performance of different operating conditions becomes an important issue. Here, we provide a range of visual and quantitative tools imported from Receiver Operating Characteristic (ROC) analysis. More precisely, we show the utility of ROC analysis from a triple perspective as a tool for: (1) showing model performance; (2) choosingmodels; and (3) assessing the impact of operating conditions on model performance. We illustrate the selection of cash management models by means of a numerical example., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Empirical analysis of daily cash flow time series and its implications for forecasting

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Rodriguez-Aguilar, Juan A.
  • Serrà,Joan
  • Guillen, Montserrat
  • Martin, Francisco J.
[EN] Usual assumptions on the statistical properties of daily net cash flows include normality, absence of correlation and stationarity. We provide a comprehensive study based on a real-world cash flow data set showing that: (i) the usual assumption of normality, absence of correlation and stationarity hardly appear; (ii) non-linearity is often relevant for forecasting; and (iii) typical data transformations have little impact on linearity and normality. This evidence may lead to consider a more data-driven approach such as time-series forecasting in an attempt to provide cash managers with expert systems in cash management., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Boundless multiobjective models for cash management

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Rodriguez-Aguilar, Juan A
[EN] Cash management models are usually based on a set of bounds that complicate the selection of the optimal policies due to nonlinearity. We here propose to linearize cash management models to guarantee optimality through linear-quadratic multiobjective compromise programming models. We illustrate our approach through a reformulation of the suboptimal state-of-the-art Gormley-Meade¿s model to achieve optimality. Furthermore, we introduce a much simpler formulation that we call the boundless model that also provides optimal solutions without using bounds. Results from a sensitivity analysis using real data sets from 54 different companies show that our boundless model is highly robust to cash flow prediction errors., Generalitat de Catalunya [2014 SGR 118]; Ministerio de Economia y Competitividad [Collectiveware TIN2015-66863-C2-1-R].
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Detecting and correcting the binding-affinity bias in ChIP-seq data using inter-species information

  • Nettling, Martin
  • Treutler, Hendrik
  • Cerquides, Jesús
  • Grosse, Ivo
Background: Transcriptional gene regulation is a fundamental process in nature, and the experimental and computational investigation of DNA binding motifs and their binding sites is a prerequisite for elucidating this process. ChIP-seq has become the major technology to uncover genomic regions containing those binding sites, but motifs predicted by traditional computational approaches using these data are distorted by a ubiquitous binding-affinity bias. Here, we present an approach for detecting and correcting this bias using inter-species information. Results: We find that the binding-affinity bias caused by the ChIP-seq experiment in the reference species is stronger than the indirect binding-affinity bias in orthologous regions from phylogenetically related species. We use this difference to develop a phylogenetic footprinting model that is capable of detecting and correcting the binding-affinity bias. We find that this model improves motif prediction and that the corrected motifs are typically softer than those predicted by traditional approaches. Conclusions: These findings indicate that motifs published in databases and in the literature are artificially sharpened compared to the native motifs. These findings also indicate that our current understanding of transcriptional gene regulation might be blurred, but that it is possible to advance this understanding by taking into account inter-species information available today and even more in the future., We thank DFG (grant no. GR3526/1), Gencat (2014 SGR 118), and Collectiveware (TIN2015-66863-C2-1-R) for financial support, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Automating Decision Making to Help Establish Norm-Based Regulations

  • López-Sánchez, Maite
  • Serramia, Marc
  • Rodríguez-Aguilar, Juan Antonio
  • Morales, Javier
  • Wooldridge, Michael
Norms have been extensively proposed as coordination mechanisms for both agent and human societies. Nevertheless, choosing the norms to regulate a society is by no means straightforward. The reasons are twofold. First, the norms to choose from may not be independent (i.e, they can be related to each other). Second, different preference criteria may be applied when choosing the norms to enact. On the one hand, this paper considers norm representation power and cost as alternative preference criteria. On the other hand, it identifies three different norm relationships --namely, generalisation, exclusivity, and substitutability. We show that the decisionmaking problem faced by policy makers can be encoded as a linear program, and hence solved with the aid of state-of-the-art solvers. Copyright © 2018 ACM, Inc., Work funded by projects Collectiveware (TIN2015-66863-C2-1-R) (MINECO/FEDER), 2009-SGR-1434, and 2014 SGR 623. Javier Morales is a Marie Curie research fellow (H2020-MSCA-IF project number 707668). Mike Wooldridge was supported by the ERC under Advanced Grant 291528 (“RACE”), Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Evolutionary Synthesis of Stable Normative Systems

  • Morales, Javier
  • Wooldridge, Michael
  • Rodríguez-Aguilar, Juan Antonio
  • López-Sánchez, Maite
Normative systems are a widely used framework to coordi-nate interdependent activities in multi-agent systems. Most research in this area has focused on how to compute norma-tive systems that effectively accomplish a coordination task, as well as additional criteria such as synthesising norms that do not over-regulate a system, and the emergence of norms that remain stable over time. We introduce a framework for the synthesis of stable normative systems that are sufficient and necessary for coordination. Our approach is based on ideas from evolutionary game theory. We simulate multi-agent systems in which useful norms are more likely to prosper than useless norms. We empirically show the effectiveness of our approach in a simulated traffic domain. © Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved., Work funded by the H2020-MSCA-IF project number 707688. Mike Wooldridge was supported by the ERC under Advanced Grant 291528 (“RACE”). Maite López-Sánchez and Juan A. Rodríguez-Aguilar were supported by projects Collectiveware (TIN2015-66863-C2-1-R, MINECO/FEDER), 2009-SGR-1434, and 2014 SGR 623, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

AD3-GLaM: A Cooperative Distributed QoE-based Approach for SVC Video Streaming over Wireless Mesh Networks

  • Quang Pham, Tran Anh
  • Deep Singh, Kamal
  • Rodríguez-Aguilar, Juan Antonio
  • Picard, Gauthier
  • Piamrat, Kandaraj
  • Cerquides, Jesús
  • Viho, César
We study the routing problem of scalable video coding video streaming over wireless mesh networks. In contrast to most of the conventional routing algorithms, our proposal focuses on optimizing users’ satisfaction. The mean opinion score –an indicator of quality of experience (QoE) in video streaming– is utilized to assess the quality of routes in wireless mesh networks. The objective is to optimize the overall user experience in the network. Conventional routing approaches do not consider QoE and are not optimal with respect to user experience. Moreover, some centralized approaches are not scalable and require significant computational resources. The latter disadvantage can be overcome using distributed approaches. This paper presents a QoE-based cooperative distributed routing approach. Among distributed cooperative optimization schemes, AD3 is highlighted as one of the most efficient because of its fast convergence. The contributions of this paper are as follows: we encode the original problem into a factor graph and optimize the number of exchanged messages; we propose a partially distributed routing scheme based on OLSR and AD3; and we propose a distributed decoding algorithm in order to find a feasible solution. Our thorough simulation results confirm the advantages of the proposed scheme., This work has been partly supported by EIT Digital and projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A multi-objective approach to the cash management problem

  • Salas-Molina, Francisco
  • Pla-Santamaría, David
  • Rodríguez-Aguilar, Juan Antonio
Cash management is concerned with optimizing costs of short-term cash policies of a company. Different optimization models have been proposed in the literature whose focus has been only placed on a single objective, namely, on minimizing costs. However, cash managers may also be interested in risk associated to cash policies. In this paper, we propose a multi-objective cash management model based on compromise programming that allows cash managers to select the best policies, in terms of cost and risk, according to their risk preferences. The model is illustrated through several examples using real data from an industrial company, alternative cost scenarios and two different measures of risk. As a result, we provide cash managers with a new tool to allow them deciding on the level of risk to take in daily decision-making., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Empirical analysis of daily cash flow time-series and its implications for forecasting

  • Salas-Molina, Francisco
  • Rodríguez-Aguilar, Juan Antonio
  • Serra, Joan
  • Guillén, Montserrat
  • Martin, Francisco J.
Usual assumptions on the statistical properties of daily net cash flows include normality, absence of correlation and stationarity. We provide a comprehensive study based on a real-world cash flow data set showing that: (i) the usual assumption of normality, absence of correlation and stationarity hardly appear; (ii) non-linearity is often relevant for forecasting; and (iii) typical data transformations have little impact on linearity and normality. This evidence may lead to consider a more data-driven approach such as time-series forecasting in an attempt to provide cash managers with expert systems in cash management., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/ FEDER) and 2014 SGR 118, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Off-line synthesis of evolutionarily stable normative systems

  • Morales, Javier
  • Wooldridge, Michael
  • Rodríguez-Aguilar, Juan Antonio
  • López-Sánchez, Maite
Within the area of multi-agent systems, normative systems are a widely used framework for the coordination of interdependent activities. A crucial problem associated with normative systems is that of synthesising norms that will effectively accomplish a coordination task and that the agents will comply with. Many works in the literature focus on the on-line synthesis of a single, evolutionarily stable norm (convention) whose compliance forms a rational choice for the agents and that effectively coordinates them in one particular coordination situation that needs to be identified and modelled as a game in advance. In this work, we introduce a framework for the automatic off-line synthesis of evolutionarily stable normative systems that coordinate the agents in multiple interdependent coordination situations that cannot be easily identified in advance nor resolved separately. Our framework roots in evolutionary game theory. It considers multi-agent systems in which the potential conflict situations can be automatically enumerated by employing MAS simulations along with basic domain information. Our framework simulates an evolutionary process whereby successful norms prosper and spread within the agent population, while unsuccessful norms are discarded. The outputs of such a natural selection process are sets of codependent norms that, together, effectively coordinate the agents in multiple interdependent situations and are evolutionarily stable. We empirically show the effectiveness of our approach through empirical evaluation in a simulated traffic domain., Research supported by the H2020-MSCA-IF project number 707688 (EVNSMAS). Michael Wooldridge was supported by the European Research Council under Grant 291528 (RACE). Juan A. Rodríguez-Aguilar and Maite López-Sánchez were funded by projects TASSAT3: TIN2016-76573-C2-2-P and Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Selecting cash management models from a multiobjective perspective

  • Salas-Molina, Francisco
  • Rodríguez-Aguilar, Juan Antonio
  • Díaz-García, Pablo
This paper addresses the problem of selecting cash management models under different operating conditions from a multiobjective perspective considering not only cost but also risk. A number of models have been proposed to optimize corporate cash management policies. The impact on model performance of different operating conditions becomes an important issue. Here, we provide a range of visual and quantitative tools imported from Receiver Operating Characteristic (ROC) analysis. More precisely, we show the utility of ROC analysis from a triple perspective as a tool for: (1) showing model performance; (2) choosing models; and (3) assessing the impact of operating conditions on model performance. We illustrate the selection of cash management models by means of a numerical example., Work partially funded by projects Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The composition and formation of effective teams: computer science meets psychology

  • Andrejczuk, Ewa
  • Berger, Rita
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
  • Martín-Puchades, Víctor
Nowadays the composition and formation of effective teams is highly important for both companies to assure their competitiveness and for a wide range of emerging applications exploiting multiagent collaboration (e.g. crowdsourcing, human-agent collaborations). The aim of this article is to provide an integrative perspective on team composition, team formation, and their relationship with team performance. Thus, we review the contributions in both the computer science literature and the organizational psychology literature dealing with these topics. Our purpose is twofold. First, we aim at identifying the strengths and weaknesses of the contributions made by these two diverse bodies of research. Second, we aim at identifying cross-fertilization opportunities that help both disciplines benefit from one another. Given the volume of existing literature, our review is not intended to be exhaustive. Instead, we have preferred to focus on the most significant contributions in both fields together with recent contributions that break new ground to spur innovative research., This work is supported by projects CollectiveMind (funded by the Spanish Ministry of Economy and Competitiveness, under grant number TEC2013-49430- EXP), Collectiveware (TIN2015-66863-C2-1-R MINECO/ FEDER), 2017 SGR 172, and MILESS (Ministerio de Economía y Competitividad) TIN2013-45039-P Financed by FEDER. The first author is supported by an Industrial PhD scholarship from the Generalitat de Catalunya (DI-060)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

An algorithm based on ant colony optimization for the minimum connected dominating set problem

  • Bouamama, Salim
  • Blum, Christian
  • Fages, Jean-Guillaume
Ant colony optimization is a well established metaheuristic from the swarm intelligence field for solving difficult optimization problems. In this work we present an application of ant colony optimization to the minimum connected dominating set problem, which is an NP-hard combinatorial optimization problem. Given an input graph, valid solutions are connected subgraphs of the given input graph. Due to the involved connectivity constraints, out-of-the-box integer linear programming solvers do not perform well for this problem. The developed ant colony optimization algorithm uses reduced variable neighborhood search as a sub-routine. Moreover, it can be applied to the weighted and to the non-weighted problem variants. An extensive experimental evaluation presents the comparison of our algorithm with the respective state-of-the-art techniques from the literature. It is shown that the proposed algorithm outperforms the current state of the art for both problem variants. For comparison purposes we also develop a constraint programming approach based on graph variables. Even though its performance deteriorates with growing instance size, it performs surprisingly well, solving 315 out of 481 considered problem instances to optimality., Christian Blum acknowledges support from project Collectiveware, TIN2015-66863-C2-1-R (Spanish Ministry for Economy and Competitiveness, FEDER funds from the European Union )., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Combining social choice theory and argumentation: enabling collective decision making

  • Ganzer-Ripoll, J.
  • Criado, Natalia
  • López-Sánchez, Maite
  • Parsons, Simon
  • Rodríguez-Aguilar, Juan Antonio
Argumentation-based debates are mechanisms that a group can use to resolve conflicting opinions and hence reach agreement. They have many potential applications in on-line communities and other open environments. In this paper, we provide computational infrastructure to support argumentation-based debates, in particular focusing on the problem of how participants in a debate can reach agreement about the outcome of the debate, given all the statements that have been made. Our approach makes it possible to represent arguments that are put forward by the participants in a debate, allows both positive and negative relationships between the arguments to be represented, and makes it possible for participants to express opinions about both the arguments and the outcome of the debate. Our main contribution is to provide a novel method—indeed the first method—for computing the collective decision that emerges from the combination of a set of arguments and a set of opinions about whether the arguments hold or not. To do this, we carry out a formal investigation of a family of aggregation functions. This family starts with a function that is firmly rooted in the social choice literature, and is extended with functions that are more oriented towards the use of argumentation. We prove that to ensure that the collective decision is coherent, a property that we think is essential, an aggregation function needs to take into account the dependencies between arguments. We also provide an empirical analysis of the performance of our approach to reaching a collective decision, showing that a collective decision can be reached for debates, of the size that one currently finds online, in reasonable time., This work was partly funded by Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER), 2017 SGR 341, 2017 SGR 172, and by EPSRC grant EP/P010105/1. Jordi Ganzer-Ripoll is supported by a PhD studentship from King’s College London., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the use of multiple criteria distance indexes to find robust cash management policies

  • Salas-Molina, Francisco
  • Rodríguez-Aguilar, Juan Antonio
  • Pla-Santamaría, David
Cash management decision-making can be handled from a multiobjective perspective by optimizing not only cost but also risk. Nevertheless, choosing the best policies under a changing context is by no means straightforward. To this end, we rely on compromise programming to incorporate robustness as an additional goal to cost and risk within a multiobjective framework. As a result, we propose to calculate robustness as a multiple criteria distance index that is able to identify the best compromise policies in terms of cost and risk. Such policies are also robust to cash flow regime changes. We show its utility by transforming the Miller and Orr's cash management model into its robust counterpart using real data from an industrial company., Ministerio de Economía y Competitividad [grant number Collectiveware TIN2015-66863-C2-1-R], [grant number 2014 SGR 118]. Work partially funded by projects Collectiveware TIN2015-66863- C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Sufficient and necessary conditions for solution finding in valuation-based systems

  • Roca-Lacostena, Jordi
  • Cerquides, Jesús
  • Pouly, Marc
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notion of solution. Typical examples are satisfying assignments in constraint systems, models in logics or solutions to linear equation systems. Dynamic programming algorithms rely on low treewidth decompositions and can be understood as particular cases of a single algorithmic scheme for finding solutions in a valuation algebra. The most encompassing description of this algorithmic scheme to date has been proposed by Pouly and Kohlas together with sufficient conditions for its correctness. Unfortunately, the formalization relies on a theorem for which we provide a counterexample. In spite of that, the mainline of Pouly and Kohlas' theory is correct, although some of the necessary conditions have to be revised. In this paper we analyze the impact that the counterexample has on the theory, and rebuild the theory providing correct sufficient conditions for the algorithms. Furthermore, we also provide necessary conditions for the algorithms, allowing for a sharper characterization of when the algorithmic scheme can be applied. The contribution of the paper is not limited to correcting Pouly and Kohlas' theory. First, we generalize their results from discrete tuples to tuple systems. This allows us to cover some classical algorithms, such as sparse Cholesky factorization, as well as more recently proposed algorithms, such as SNOWBALL (sparse all-pairs shortest path problems), as particular cases of the generic valuation-based algorithms presented here. For the particular case of valuation algebras induced by selective semirings, Pouly and Kohlas presented an algorithm for finding all solutions without requiring any additional condition for correctness. We characterize a necessary and a sufficient condition for it. Furthermore, we also introduce a new algorithm that requires no necessary condition., This work has been supported by projects COR (TIN2012-38876-C02-01), Collectiveware (TIN2015-66863-C2-1-R), GEAR (CSIC - 201350E112), by the Generalitat of Catalunya grant 2014-SGR-118 and also by the Secretaria d'Universitats i Recerca de la Generalitat de Catalunya and the European Social Funds (AGAUR 2019FI B1 00094)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Don't leave anyone behind: Achieving team performance through diversity

  • Andrejczuk, Ewa
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
  • Roig, Carme
  • Parejo-Romero, Yolanda
Trabajo presentado en Frontiers in Education Conference (FIE 2018), celebrado San Jose (Estados Unidos) del 3 al 6 de octubre de 2018, In education, student teams are composed aiming at completing academic tasks and co-learning. Key factors influencing team performance are individual competencies, personality and gender. In this paper, we present a computational model to compose proficient and congenial teams based on students’ personalities, gender, and competencies to perform tasks of different nature. Our model, called synergistic team composition, extends Wilde’s post-Jungian method, which solely employs individuals’ personalities and gender. In addition to formally present the synergistic team composition problem, we develop an approximate algorithm to solve it. That is, an algorithm that partitions student groups into teams that are diverse in competencies, personality and gender. Finally, we discuss our positive empirical results on student performance., This work was supported by projects CIMBVAL (MINECO, TIN2017-89758-R), AppPhil (RecerCaixa 2017), and Collectiveware (MINECO/FEDER, TIN2015-66863-C2-1-R). Andrejczuk thanks an Industrial PhD scholarship from the Generalitat de Catalunya (DI-060)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

A concise review on multiagent teams: contributions and research opportunities

  • Andrejczuk, Ewa
  • Rodríguez-Aguilar, Juan Antonio
  • Sierra, Carles
The composition and formation of effective teams is crucial for both companies, to assure their competitiveness, and for a broad range of emerging applications exploiting multiagent collaboration (e.g. human-agent teamwork, crowdsourcing). The aim of this article is to provide an integrative perspective on team composition, team formation and their relationship with team performance. Thus, we review and classify the contributions in the computer science literature dealing with these topics. Our purpose is twofold. First, we intend to identify the strengths and weaknesses of the contributions made so far. Second, we pursue to identify research gaps and opportunities. Given the volume of the existing literature, our review is not intended to be exhaustive. Instead, we focus on the most recent contributions that broke new ground to spur innovative research., Work supported by Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER), CollectiveMind (MINECO TEC2013-49430-EXP), SMA (201550E040), and Gencat 2014 SGR 118. Ewa Andrejczuk is supported by an Industrial PhD scholarship from the Generalitat de Catalunya., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

A Multi-agent argumentation framework to support collective reasoning

  • Ganzer-Ripoll, J.
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
Argumentative debates are a powerful tool for resolving conflicts and reaching agreements in open environments such as on-line communities. Here we introduce an argumentation framework to structure argumentative debates. Our framework represents the arguments issued by the participants involved in a debate, the (attack and defence) relationships between them, as well as participants’ opinions on them. Furthermore, we tackle the problem of computing a collective decision from participants’ opinions. With this aim, we design an aggregation function that satisfies valuable social-choice properties., Funded by Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

A target-oriented discussion framework to support dollective decision making

  • Ganzer-Ripoll, J.
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
Argumentative debates are a powerful tool for resolving conflicts and reaching agreements in open environments such as on-line communities. Here we introduce an argumentation framework to structure argumentative debates. Our framework represents the arguments issued by the participants involved in a debate, the (attack and defence) relationships between them, as well as participants’ opinions on them. Furthermore, we tackle the problem of computing a collective decision from participants’ opinions. With this aim, we design an aggregation function to ensure that participants reach a coherent collective decision., Funded by Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER) and 2014 SGR 118., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Event detection in location-based social networks

  • Capdevila, Joan
  • Cerquides, Jesús
  • Torres, Jordi
With the advent of social networks and the rise of mobile technologies, users have become ubiquitous sensors capable of monitoring various real-world events in a crowd-sourced manner. Location-based social networks have proven to be faster than traditional media channels in reporting and geo-locating breaking news, i.e. Osama Bin Laden’s death was first confirmed on Twitter even before the announcement from the communication department at the White House. However, the deluge of user-generated data on these networks requires intelligent systems capable of identifying and characterizing such events in a comprehensive manner. The data mining community coined the term, event detection , to refer to the task of uncovering emerging patterns in data streams . Nonetheless, most data mining techniques do not reproduce the underlying data generation process, hampering to self-adapt in fast-changing scenarios. Because of this, we propose a probabilistic machine learning approach to event detection which explicitly models the data generation process and enables reasoning about the discovered events. With the aim to set forth the differences between both approaches, we present two techniques for the problem of event detection in Twitter : a data mining technique called Tweet-SCAN and a machine learning technique called Warble. We assess and compare both techniques in a dataset of tweets geo-located in the city of Barcelona during its annual festivities. Last but not least, we present the algorithmic changes and data processing frameworks to scale up the proposed techniques to big data workloads., This work is partially supported by Obra Social “la Caixa”, by the Spanish Ministry of Science and Innovation under contract (TIN2015-65316), by the Severo Ochoa Program (SEV2015-0493), by SGR programs of the Catalan Government (2014-SGR-1051, 2014-SGR-118), Collectiveware (TIN2015-66863-C2-1-R) and BSC/UPC NVIDIA GPU Center of Excellence. We would also like to thank the reviewers for their constructive feedback., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Empowering cash managers through compromise programming

  • Salas-Molina, Francisco
  • Pla-Santamaría, David
  • Rodríguez-Aguilar, Juan Antonio
Typically, the cash management literature focuses on optimizing cost, hence neglecting risk analysis. In this chapter, we address the cash management problem from a multiobjective perspective by considering not only the cost but also the risk of cash policies. We propose novel measures to incorporate risk analysis as an additional goal in cash management. Next, we rely on compromise programming as a method to minimize the sum of weighted distances to an ideal point where both cost and risk are minimum. These weights reflect the particular preferences of cash managers when selecting the best policies that solve the multiobjective cash management problem. As a result, we suggest three alternative solvers to cover a wide range of possible situations: Monte Carlo methods, linear programming, and quadratic programming. We also provide a Python software library with an implementation of the proposed solvers ready to be embedded in cash management decision support systems. We finally describe a framework to assess the utility of cash management models when considering multiple objectives., Work partially funded by projects 2014 SGR 118 and Collectiveware TIN2015-66863-C2-1-R (MINECO/FEDER)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Agregation operators to compute norm support in virtual communities

  • Serramia, Marc
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
Moderation in virtual communities should not be a private privilege. This paper proposes a method for participants in a social network to decide their own rules for accepting (or not) contents. With the norm argument map, participants are able to argue about norms and voice their opinions about other people’s arguments. This structure, equipped with a method to fuse all the data introduced by participants, makes it possible to evaluate the people’s support for a norm and decide whether the norm should be applied or discarded., Work supported by project Collectiveware (MINECO/FEDER), Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Event detection in location-based social networks

  • Capdevila Pujol, Joan
  • Cerquides, Jesús
  • Torres Viñals, Jordi|||0000-0003-1963-7418
With the advent of social networks and the rise of mobile technologies, users have become ubiquitous sensors capable of monitoring various real-world events in a crowd-sourced manner. Location-based social networks have proven to be faster than traditional media channels in reporting and geo-locating breaking news, i.e. Osama Bin Laden’s death was first confirmed on Twitter even before the announcement from the communication department at the White House. However, the deluge of user-generated data on these networks requires intelligent systems capable of identifying and characterizing such events in a comprehensive manner. The data mining community coined the term, event detection , to refer to the task of uncovering emerging patterns in data streams . Nonetheless, most data mining techniques do not reproduce the underlying data generation process, hampering to self-adapt in fast-changing scenarios. Because of this, we propose a probabilistic machine learning approach to event detection which explicitly models the data generation process and enables reasoning about the discovered events. With the aim to set forth the differences between both approaches, we present two techniques for the problem of event detection in Twitter : a data mining technique called Tweet-SCAN and a machine learning technique called Warble. We assess and compare both techniques in a dataset of tweets geo-located in the city of Barcelona during its annual festivities. Last but not least, we present the algorithmic changes and data processing frameworks to scale up the proposed techniques to big data workloads., This work is partially supported by Obra Social “la Caixa”, by the Spanish Ministry of Science and Innovation under contract (TIN2015-65316), by the Severo Ochoa Program (SEV2015-0493), by SGR programs of the Catalan Government (2014-SGR-1051, 2014-SGR-118), Collectiveware (TIN2015-66863-C2-1-R) and BSC/UPC NVIDIA GPU Center of Excellence.We would also like to thank the reviewers for their constructive feedback., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Event detection in location-based social networks

  • Capdevila Pujol, Joan
  • Cerquides, Jesús
  • Torres Viñals, Jordi
With the advent of social networks and the rise of mobile technologies, users have become ubiquitous sensors capable of monitoring various real-world events in a crowd-sourced manner. Location-based social networks have proven to be faster than traditional media channels in reporting and geo-locating breaking news, i.e. Osama Bin Laden’s death was first confirmed on Twitter even before the announcement from the communication department at the White House. However, the deluge of user-generated data on these networks requires intelligent systems capable of identifying and characterizing such events in a comprehensive manner. The data mining community coined the term, event detection , to refer to the task of uncovering emerging patterns in data streams . Nonetheless, most data mining techniques do not reproduce the underlying data generation process, hampering to self-adapt in fast-changing scenarios. Because of this, we propose a probabilistic machine learning approach to event detection which explicitly models the data generation process and enables reasoning about the discovered events. With the aim to set forth the differences between both approaches, we present two techniques for the problem of event detection in Twitter : a data mining technique called Tweet-SCAN and a machine learning technique called Warble. We assess and compare both techniques in a dataset of tweets geo-located in the city of Barcelona during its annual festivities. Last but not least, we present the algorithmic changes and data processing frameworks to scale up the proposed techniques to big data workloads., This work is partially supported by Obra Social “la Caixa”, by the Spanish Ministry of Science and Innovation under contract (TIN2015-65316), by the Severo Ochoa Program (SEV2015-0493), by SGR programs of the Catalan Government (2014-SGR-1051, 2014-SGR-118), Collectiveware (TIN2015-66863-C2-1-R) and BSC/UPC NVIDIA GPU Center of Excellence.We would also like to thank the reviewers for their constructive feedback., Peer Reviewed, Postprint (author's final draft)
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Coalition structure generation problems, optimization and parallelization of the IDP algorithm in multicore systems

  • Cruz Mencía, Francisco
  • Cerquides Bueno, Jesus|||0000-0002-3752-644X
  • Rodríguez-Aguilar, Juan A.
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Moure, Juan C.|||0000-0001-6697-0331
  • Ramchurn, Sarvapali D.
  • Svensson, Kim
The coalition structure generation problem is well known in the area of multi-agent systems. Its goal is to establish coalitions between agents while maximizing the global welfare. Among the existing different algorithms designed to solve the coalition structure generation problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the operation of the dynamic programming and improved dynamic programming algorithms, we have identified which are the most frequent operations and propose an optimized method. In addition, we study and implement a method for dividing the work into different threads. To describe incremental improvements of the algorithm design, we first compare performance of an improved single central processing unit core version where we obtain speedups ranging from 7 × to 11 × . Then, we describe the best resource use in a multi-thread optimized version where we obtain an additional 7.5 × speedup running in a 12-core machine.