Pasar al contenido principal

OPTIMIZACION, APRENDIZAJE Y COOPERACION CON APLICACIONES EN ENERGIA

PID2021-124030NB-C32

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDADE DE SANTIAGO DE COMPOSTELA

Resultados relacionados

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

Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

An allocation rule for connection scheduling problems

  • Davila Pena, Laura
  • Borm, Peter
  • García Jurado, Ignacio
  • Schouten, Jop
This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

A sampling approach for the approximation of the Deegan-Packel index

  • Armijos-Toro, L. M.
  • Alonso-Meijide, J. M.
  • Mosquera Criado, María Jesús
  • Saavedra Nieves, Alejandro
In this paper, we address a sampling procedure for approximating the Deegan-Packel index, which is particularly advantageous when tackling with large-scale problems. It is based on the estimation of an expectation in a subdomain. Its performance is analyzed in terms of statistical properties and of bounds for the incurred absolute error. The effectiveness of this tool is demonstrated through a real-world example where this power index can be exactly computed. Finally, we use it to determine a new power distribution for two compositions of the Board of Governors of the International Monetary Fund (IMF). The resulting distributions of the power are compared with the ones prescribed by the Shapley and the Banzhaf values.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

A connection-based analysis of networks using the position value: a computational approach

  • Algaba Durán, Encarnación
  • Saavedra Nieves, Alejandro
In this paper, we introduce the position value as a centrality measure to evaluate the relevance of the edges and players in a network, with the additional advantage that this value integrates the degree measure of each player in it. In fact, in the real world, it is particularly important to consider the natural influence of connections of a player in a network. Its applications were very limited in real-world situations due to the high computational complexity of exactly obtaining this value. With the aim of solving this problem we provide a method, based on sampling theory, to estimate the position value, which is analyzed in terms of the theoretical properties of the resulting estimator. Moreover, we establish specific statistical results for bounding the absolute error in this approximation. It is important to emphasize that this approach allows for obtaining rankings not only of the nodes but also of the edges of the network. To illustrate the advantages and interest of the proposed methodology, as well as the variety of problems that can be analyzed in this framework, we applied it in three very different settings, the suburban train network of Madrid in the year 2000, the Spanish national team in a match against Portugal, and the Zerkani network responsible for the terrorist attacks of Paris (2015) and Brussels (2016)
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Mergeable weighted majority games and characterizations of some power indices

  • Armijos Toro, Livino Manuel
  • Alonso Meijide, José María
  • Mosquera Rodríguez, Manuel Alfredo
In this paper, we introduce a notion of mergeable weighted majority games with the aim of providing the first characterization of the Colomer–Martínez power index (Colomer and Martínez in J Theor Polit 7(1):41–63, 1995). Furthermore, we define and characterize a new power index for the family of weighted majority games that combines ideas of the Public Good (Holler in Polit Stud 30(2):262–271, 1982) and Colomer–Martínez power indices. Finally, we analyze the National Assembly of Ecuador using these and some other well-known power indices
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

On stratified sampling for estimating coalitional values

  • Saavedra Nieves, Alejandro
This paper addresses two sampling methodologies to respectively estimate the Owen value and the Banzhaf–Owen value for TU-games with a priori unions. Both proposals are based on stratified sampling on the set of those coalitions that are compatible with the system of unions according to their cardinalities. These sampling methodologies are analysed in terms of the theoretical properties and of the establishment of bounds for the absolute error from a statistical point of view. Finally, we evaluate the performance of these tools on several real well-known examples in the literature
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Parameter estimation in ODEs: assessing the potential of local and global solvers

  • Fernández de Dios, M.
  • González Rueda, Ángel Manuel
  • Rodríguez Banga, Julio
  • González Díaz, Julio
  • Rodríguez Penas, David
We consider the problem of parameter estimation in dynamic systems described by ordinary differential equations. A review of the existing literature emphasizes the need for deterministic global optimization methods due to the nonconvex nature of these problems. Recent works have focused on expanding the capabilities of specialized deterministic global optimization algorithms to handle more complex problems. Despite advancements, current deterministic methods are limited to problems with a maximum of around five state and five decision variables, prompting ongoing efforts to enhance their applicability to practical problems. Our study seeks to assess the effectiveness of state-of-the-art general-purpose global and local solvers in handling realistic-sized problems efficiently, and evaluating their capabilities to cope with the nonconvex nature of the underlying estimation problems.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Sequencing situations with position-dependent effects under cooperation

  • Saavedra Nieves, Alejandro
  • Mosquera, M. A.
  • Fiestras Janeiro, M.G.
This paper innovatively addresses the effect of cooperation on sequencing situations with position-dependent effects. Specifically, we ensure the convexity of the associated sequencing games under the fulfillment of certain conditions related to the neighbor switching gains. Additionally, we propose two families of allocation rules based on sharing the neighbor switching gains under two distinct procedures, each providing a path from the initial order to an optimal order. From a theoretical point of view, an axiomatization of both families of allocations is provided, and their stability is also ensured under the conditions related to convexity.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Highway toll allocation problem revisited: New methods and characterizations

  • Soto Rodríguez, Paula
  • Casas Méndez, Balbina
  • Saavedra Nieves, Alejandro
This paper revisits the highway toll allocation problem (Wu, van den Brink, and Estévez-Fernández in Transport Res B-Meth 180:10288, 2024). The objective is to allocate toll revenues collected along a highway among its segments so as to support their maintenance and improvement. We propose and characterize two new allocation methods, the Segment Proportional and Segment Compensated Sharing methods, and compare them with the Segment Equal Sharing method studied in the literature. We further analyze the relationship between these methods and solution concepts from cooperative game theory. Building on this analysis, we introduce a general family of toll allocation rules that encompasses the three methods, enabling a systematic study of core allocations in the associated cooperative game. Finally, we assess the performance of these methods using a real-world dataset.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

On the influence of dependent features in classification problems: A game-theoretic perspective

  • Davila Pena, Laura
  • Casas Méndez, Balbina
  • Saavedra Nieves, Alejandro
This paper deals with a new measure of the influence of each feature on the outcome in classification problems, accounting for potential dependencies among certain feature subsets. Within this framework, we consider a sample of individuals characterized by specific features, each feature encompassing a finite range of values, and classified based on a binary outcome. This measure turns out to be an influence measure explored in existing literature and related to cooperative game theory. We provide an axiomatic characterization of our proposed influence measure by tailoring properties from the cooperative game theory to our specific context. Furthermore, we demonstrate that our influence measure becomes a general characterization of the well-known Banzhaf-Owen value for games with a priori unions, from the perspective of classification problems. The definitions and results presented herein are illustrated through numerical examples and various applications, offering practical insights into our methodologies.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Risk analysis sampling methods in terrorist networks based on the Banzhaf value

  • Algaba Durán, Encarnación
  • Prieto, Andrea
  • Saavedra Nieves, Alejandro
This article introduces the Banzhaf and the Banzhaf–Owen values as novel measures of risk analysis of a terrorist attack, determining the most dangerous terrorists in a network. This new approach counts with the advantage of integrating at the same time the complete topology (i.e., nodes and edges) of the network and a coalitional structure on the nodes of the network. More precisely, the characteristics of the nodes (e.g., terrorists) of the network and their possible relationships (e.g., types of communication links), as well as coalitional information (e.g., level of hierarchies) independent of the network. First, for these two new measures of risk analysis, we provide and implement approximation algorithms. Second, as illustration, we rank the members of the Zerkani network, responsible for the attacks in Paris (2015) and Brussels (2016). Finally, we give a comparison between the rankings established by the Banzhaf and the Banzhaf–Owen values as measures of risk analysis
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Cost allocation problems on highways with grouped users

  • Gómez-Rodríguez, Marcos
  • Davila Pena, Laura
  • Casas Méndez, Balbina
One of the practical applications of cooperative transferable utility games involves determining the fee structure for users of a given facility, whose construction or maintenance costs need to be recouped. In this context, certain efficiency and equity criteria guide the considered solutions. This paper analyzes how to allocate the fixed costs of a highway among its users through tolls, considering that different classes of vehicles or travelers utilize the service. For this purpose, we make use of generalized highway games with a priori unions that represent distinct user groups, such as frequent travelers or truckers, who, due to enhanced bargaining power, often secure reductions in their fares in real-world scenarios. In particular, the Owen value, the coalitional Tijs value, and a new value termed the Shapley–Tijs value are axiomatically characterized. Additionally, straightforward formulations for calculating these values are provided. Finally, the proposed methodology is applied to actual traffic data from the AP-9 highway in Spain.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Publicación Artículo científico (JournalArticle)

Computational advances in polynomial optimization: RAPOSa, a freely available global solver

  • González Rodríguez, Brais
  • Ossorio Castillo, Joaquín
  • González Díaz, Julio
  • González Rueda, Ángel Manuel
  • Rodríguez Penas, David
In this paper we introduce RAPOSa, a global optimization solver specifically designed for (continuous) polynomial programming problems with box-constrained variables. Written entirely in C++, RAPOSa is based on the Reformulation-Linearization (Sherali and Tuncbilek in J Glob Optim 103:225–249, 1992). We present a description of the main characteristics of RAPOSa along with a thorough analysis of the impact on its performance of various enhancements discussed in the literature, such as bound tightening and SDP cuts. We also present a comparative study with three of the main state-of-the-art global optimization solvers: BARON, Couenne and SCIP
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

On generating functions to compute some power measures for weighted majority games

  • Armijos Toro, L.M.
  • Alonso Meijide, J.M.
  • Mosquera Rodríguez, Manuel Alfredo
  • Saavedra Nieves, A.
In this paper we introduce new procedures, based on generating functions, for calculating some power measures for weighted majority games. In particular, we present methods for computing the Johnston index and the Colomer–Martínez measure. Besides, we introduce a new power measure that combines the principles underlying the Johnston index and Colomer–Martínez measure as well as a procedure for computing it using generating functions. Finally, we introduce the new R package powerindexR and describe its capabilities to compute some power measures by means of generating functions. We illustrate its performance with a real example., Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C32, Xunta de Galicia | Ref. ED431C-2020/03, Xunta de Galicia | Ref. ED431C 2021/24, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Capítulo o parte de un libro (BookPart)

An application of power indices for the family of weighted majority games in partition function form

  • Alonso Meijide, José María
  • Armijos Toro, L.M.
  • Casas Méndez, Balbina
  • Mosquera Rodríguez, Manuel Alfredo
Based on Holler (1982), Colomer and Martínez (1995), and Armijos-Toro et al. (2021), we propose two power indices to measure the influence of the players in these classes of weighted majority games in partition function form. We compare the new power indices with their original versions on the class of games in characteristic function form. Finally, we use both new power indices and the two power indices for games in partition function form studied in Alonso-Meijide et al. (2017) to study the distribution of power in the National Assembly of Ecuador that emerged after the elections of February 7, 2021., Ministerio de Economía y Competitividad | Ref. MTM2017-87197-C3-2-P, Ministerio de Economía y Competitividad | Ref. MTM2017-87197-C3-3-P, Ministerio de Ciencia e Innovación | Ref. PID2021-124030NB-C32, Ministerio de Ciencia e Innovación | Ref. PID2021-124030NB-C33, Xunta de Galicia | Ref. ED431C-2021/24, Xunta de Galicia | Ref. ED431C-2020/03
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

On the least square prenucleolus for games with externalities

  • Fiestras Janeiro, Maria Gloria
  • Saavedra Nieves, A.
Abstract In this paper we address the problem of determining the least square prenucleolus for games with externalities. Specifically, this solution is based on the minimization of the variance of the excess vectors that can be associated to any allocation vector over the set of all embedded coalitions using a least square criterion. From a theoretical point of view, an axiomatization of this solution is provided. Besides, we analyse its relations with other proposals of solution in the game-theoretical literature., Xunta de Galicia | Ref. ED431C-2020/03, Xunta de Galicia | Ref. ED431C 2021/24, Universidade de Vigo/CISUG, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Agencia Estatal de Investigación | Ref. PID2021- 124030NB-C32
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

A sampling approach for the approximation of the Deegan-Packel index

  • Armijos Toro, L.M.
  • Alonso Meijide, J.M.
  • Mosquera Rodríguez, Manuel Alfredo
  • Saavedra Nieves, A.
In this paper, we address a sampling procedure for approximating the Deegan-Packel index, which is particularly advantageous when tackling with large-scale problems. It is based on the estimation of an expectation in a subdomain. Its performance is analyzed in terms of statistical properties and of bounds for the incurred absolute error. The effectiveness of this tool is demonstrated through a real-world example where this power index can be exactly computed. Finally, we use it to determine a new power distribution for two compositions of the Board of Governors of the International Monetary Fund (IMF). The resulting distributions of the power are compared with the ones prescribed by the Shapley and the Banzhaf values., Xunta de Galicia | Ref. ED431C-2020/03, Xunta de Galicia | Ref. ED431C-2021/24, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C32
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Two families of values for global cooperative games

  • Alonso Meijide, J.M.
  • Álvarez-Mozos, M.
  • Fiestras Janeiro, Maria Gloria
  • Jiménez-Losada, A.
A global (cooperative) game describes the utility that the whole set of players generates depending on the coalition structure they form. These games were introduced by Gilboa and Lehrer (Int J Game Theory 20:129–147, 1991) who proposed and characterized a generalization of the Shapley value. We introduce two families of point valued solutions that contain the Gilboa–Lehrer value. We characterize each family by means of reasonable properties, which are related to the ones used by Gilboa and Lehrer., Agència de Gestió d’Ajuts Universitaris i de Recerca | Ref. 2021-SGR-00306, Agencia Estatal de Investigación | Ref. PID2020- 113110GB-I00, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C32, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Agencia Estatal de Investigación | Ref. PID2022- 138956NB-100, Xunta de Galicia | Ref. ED431C-2020/03, Xunta de Galicia | Ref. ED431C-2021/24, Generalitat de Catalunya | Ref. 2021-SGR-00306
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Sequencing situations with position‐dependent effects under cooperation

  • Saavedra Nieves, Alejandro
  • Mosquera Rodríguez, Manuel Alfredo
  • Fiestras Janeiro, Maria Gloria
This paper innovatively addresses the effect of cooperation on sequencing situations with position-dependent effects. Specifically, we ensure the convexity of the associated sequencing games under the fulfillment of certain conditions related to the neighbor switching gains. Additionally, we propose two families of allocation rules based on sharing the neighbor switching gains under two distinct procedures, each providing a path from the initial order to an optimal order. From a theoretical point of view, an axiomatization of both families of allocations is provided, and their stability is also ensured under the conditions related to convexity., Agencia Estatal de Investigación | Ref. PID2021-124030NB-C32, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Xunta de Galicia | Ref. ED431C 2021/24, Xunta de Galicia | Ref. ED431C 2020/03
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Mergeable weighted majority games and characterizations of some power indices

  • Armijos Toro, Livino M.
  • Alonso Meijide, José M.
  • Mosquera Rodríguez, Manuel Alfredo
In this paper, we introduce a notion of mergeable weighted majority games with the aim of providing the first characterization of the Colomer–Martínez power index (Colomer and Martínez in J Theor Polit 7(1):41–63, 1995). Furthermore, we define and characterize a new power index for the family of weighted majority games that combines ideas of the Public Good (Holler in Polit Stud 30(2):262–271, 1982) and Colomer–Martínez power indices. Finally, we analyze the National Assembly of Ecuador using these and some other well-known power indices, Agencia Estatal de Investigación | Ref. MTM2017-87197-C3-2-P, Agencia Estatal de Investigación | Ref. MTM2017-87197-C3-3-P, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C32, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Xunta de Galicia | Ref. ED431C 2020/03, Xunta de Galicia | Ref. ED431C 2021/24
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Cost allocation problems on highways with grouped users

  • Gómez Rodríguez, Marcos
  • Davila-Pena, Laura
  • Casas Méndez, Balbina Virginia
[Abstract]: One of the practical applications of cooperative transferable utility games involves determining the fee structure for users of a given facility, whose construction or maintenance costs need to be recouped. In this context, certain efficiency and equity criteria guide the considered solutions. This paper analyzes how to allocate the fixed costs of a highway among its users through tolls, considering that different classes of vehicles or travelers utilize the service. For this purpose, we make use of generalized highway games with a priori unions that represent distinct user groups, such as frequent travelers or truckers, who, due to enhanced bargaining power, often secure reductions in their fares in real-world scenarios. In particular, the Owen value, the coalitional Tijs value, and a new value termed the Shapley–Tijs value are axiomatically characterized. Additionally, straightforward formulations for calculating these values are provided. Finally, the proposed methodology is applied to actual traffic data from the AP-9 highway in Spain., This work is part of the R+D+I project grant PID2021-124030NB-C32, funded by MCIN/AEI/10.13039/501100011033/, Spain and by “ERDF A way of making Europe”/EU . This research was also funded by Grupos de Referencia Competitiva ED431C 2021/24 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia, Spain. We would also like to thank the editor and the two anonymous referees for their constructive comments and suggestions, which helped us to improve the final version of this paper., Xunta de Galicia; ED431C 2021/24
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

An allocation rule for connection scheduling problems

  • Davila-Pena, Laura
  • Borm, Peter
  • García-Jurado, Ignacio
  • Schouten, Jop
[Abstract]: This paper studies so-called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a source is minimal and second to find a fair cost allocation of such an optimal order among the players involved. We restrict our attention to connection scheduling problems on trees and propose a recursive method to solve these tree connection scheduling problems integrated with an allocation approach. This latter mechanism consistently and recursively uses benchmark endogenous myopic orders to determine potential cost savings, which will then be appropriately allocated. Interestingly, the transition process from a benchmark myopic order to an optimal one will be smooth using the switching of blocks of agents based on the basic notion of merge segments., Laura Davila-Pena’s research was funded by the Ministry of Education, Culture and Sports ofSpain (contract FPU17/02126). This work is part of the R&D projects MTM2017-87197-C3-1-P, MTM2017-87197-C3-3-P, PID2021-124030NB-C31, and PID2021-124030NB-C32, granted byMICIU/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. This re-search was also funded by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C2021/24 and ED431C 2020/14). The authors would like to thank the editor-in-chief, the asso-ciate editor, and the three anonymous referees for their valuable comments, which helped improvean earlier version of this paper.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Beyond the Felsenthal Index: a New Power Measure Incorporating a Priori Unions

  • Mascareñas-Pazos, A.
  • Lorenzo Freire, Silvia
  • Alonso-Meijide, José Mª.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The online version contains supplementary material available at https://doi.org/10.1007/s10479-026-07302-x, [Abstract]: Within the domain of game theory, power indices are defined as functions that quantify the influence of individual participants in collective decision-making processes. Felsenthal proposed a power index with a focus on winning coalitions of least size, i.e., those coalitions that are capable of determining the final outcome and with the smallest number of players among all winning coalitions. However, the Felsenthal index overlooks preexisting affinities among the players, a common and impactful factor in real-world political and economic contexts. This paper introduces a new index based on Felsenthal’s approach, which integrates player affinities through an a priori union framework. The proposed index is rigorously characterised by two distinct sets of axiomatic properties. We demonstrate its practical utility by applying it to the International Monetary Fund’s voting system, revealing how strategic alliances significantly reshape power distributions. The index thus offers policy-makers a more sophisticated tool for measuring influence in complex decision-making scenarios., The authors thank the two anonymous reviewers and the associate editor for their comments and suggestions, which have helped us to improve a previous version of the article. This publication is part of the R+D+I project grants PID2021-12403030NB-C31 and PID2021-124030NB-C32 funded by MCIN/AEI/10.13039/501100011033/ and by ERDF/EU. It was also supported by the Xunta de Galicia (Grupos de Referencia Competitiva ED431C-2024/14 and ED431C-2025/03) and by CITIC as a centre accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). The first author received funding under the Spanish Predoctoral Research Trainees Program (RD 103/2019), as part of grant PRE2022-104510, funded by MCIN/AEI/10.13039/501100011033/ and ESF+. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C-2024/14, Xunta de Galicia; ED431C-2025/03, Xunta de Galicia; ED431G 2023/01, https://doi.org/10.1007/s10479-026-07302-x
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

On egalitarian values for cooperative games with level structures

  • Alonso-Meijide, José Mª.
  • Costa, Julián
  • García-Jurado, Ignacio
  • Gonçalves-Dosantos, J.C.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with level structures. In the case of the equal surplus division value we propose three possible extensions, one of which has already been described in the literature. We provide axiomatic characterizations of the values considered, apply them to a particular cost sharing problem and compare them in the framework of such an application., Xunta de Galicia; ED431G-2019/01, Xunta de Galicia; ED431C-2020/14, Xunta de Galicia; ED431C-2021/24, This work is part of the R+D+I project grants MTM2017-87197-C3-1-P, MTM2017-87197- C3-3-P, PID2021-124030NB-C31 and PID2021-124030NB-C32, funded by MCIN/AEI/10.13039/501100011033/ and by "ERDF A way of making Europe”/EU. This research was also funded by Grupos de Referencia Competitiva ED431G-2019/01, ED431C-2020/14 and ED431C-2021/24 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia. During the completion of this work, J. C. Gonçalves-Dosantos is a "Margarita Salas” postdoctoral researcher, carrying out a research stay at the CIO, Centro de Investigación Operativa of the Miguel Hernández University of Elche (Spain), to which he is grateful for the welcome. Funding for open access charge: Universidade da Coruña/CISUG
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Application of decomposition techniques in a wildfire suppression optimization model

  • Rodríguez-Veiga, J.
  • Penas, David R.
  • González-Rueda, A. M.
  • Ginzo-Villamayor, M.
Resource assignment and scheduling models provides an automatic and fast decision support system for wildfire suppression logistics. However, this process generates challenging optimization problems in many real-world cases, and the computational time becomes a critical issue, especially in realistic-size instances. Thus, to overcome that limitation, this work studies and applies a set of decomposition techniques such as augmented Lagrangian, branch and price, and Benders decomposition’s to a wildfire suppression model. Moreover, a reformulation strategy, inspired by Benders’ decomposition, is also introduced and demonstrated. Finally, a numerical study comparing the behavior of the proposals using different problem sizes is conducted., This research work is supported by the R+D+I project grants PID2020-116587GB-I00 and PID2021-124030NB (C31 and C32), funded by MCIN/AEI/10.13039/501100011033/ and by “ERDF A way of making Europe”/EU. Second author investigation is funded by the Xunta de Galicia (contract post-doctoral 2019-2022). We acknowledge the computational resources provided by CESGA. Third author acknowledges support from the Xunta de Galicia through the ERDF (ED431C-2020-14 and ED431G 2019/01), and “CITIC”. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Parameter estimation in ODEs: assessing the potential of local and global solvers

  • Fernández de Dios, M.
  • González-Rueda, Ángel M.
  • Banga, Julio R.
  • González-Díaz, Julio
  • Penas, David R.
39 pages, 12 tables, 14 figures; The online version contains supplementary material available at https://doi.org/10.1007/s11081-025-09978-9; Upon acceptance, all AMPL models used in the computational study will be made publicly available according to the journal standards., In this work, we address parameter estimation in models described by nonlinear ordinary differential equations (ODEs) using a direct transcription approach. Controls and state profiles are discretized, leading to a nonlinear programming (NLP) problem solvable via mathematical programming techniques. The main goal of this work is to analyze the potential of mathematical modeling and state-of-the-art solvers to handle these problems. For this purpose, an extensive numerical study on eight challenging parameter estimation problems in nonlinear dynamic biological systems is carried out. Different modeling aspects, such as discretization schemes and formulation variants, are explored. The use of global and local solvers provides insights into local optimality and identifiability challenges. Our approach yields promising results, surpassing previously reported capabilities in the literature., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work is part of the R&D projects PID2021-124030NB-C31 and PID2021-124030NB-C32 funded by MICIU/AEI/10.13039/501100011033/ and by ERDF/EU. This research was also funded by Grupos de Referencia Competitiva ED431C-2021/24 from the Consellería de Cultura, Educación e Universidades, Xunta de Galicia. JRB acknowledges support from grant PID2020-117271RB-C22 (BIODYNAMICS) funded by MCIN/AEI/10.13039/501100011033, from grant PID2023-146275NB-C22 (DYNAMO-bio) funded by MICIU/AEI/ 10.13039/501100011033 and ERDF/EU, and from grant CSIC PIE 202470E108 (LARGO). The authors acknowledge CESGA (Centro de Supercomputación de Galicia) for providing access to its FinisTerrae III supercomputer.