Skip to main content

EXTERNALIDADES Y COOPERACION

PID2019-106281GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE VIGO

Resultados relacionados

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

Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Deviation from proportionality and Lorenz-domination for claims problems

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
The Lorenz order is commonly used to compare rules for claims problems. In this paper, we incorporate the average of awards rule, the mean value of the set of awards vectors for a claims problem, to the ranking of the standard rules by proving some properties that are satisfied by this rule. We define a pair of coefficients, inspired by the Gini index, aimed at measuring, for any given claims problem, the discrepancy between the awards assigned by a rule and the proportional division. We generalize the proportionality deviation indices by introducing coefficients that measure the deviation between the awards selected by any two division rules. We show how these deviation indices are related to the Lorenz order., Ministerio de Ciencia, Innovación y Universidades | Ref. MTM2017-87197-C3-2-P, Ministerio de Ciencia, Innovación y Universidades | Ref. PID2019-106281GB-I00, Xunta de Galicia | Ref. ED481A 2021/325
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

An algorithm to compute the average-of-awards rule for claims problems with an application to the allocation of CO2 emissions

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
The set of awards vectors for a claims problem coincides with the core of the associated coalitional game. We analyze the structure of this set by defining for each group of claimants a, so called, utopia game, whose core comprises the most advantageous imputations available for the group. We show that, given a claims problem, the imputation set of the associated coalitional game can be partitioned by the cores of the utopia games. A rule selects for each claims problem a unique allocation from the set of awards vectors. The average-of-awards rule associates to each claims problem the geometric center of the corresponding set of awards vectors. Based on the decomposition of the imputation set, we obtain an interpretation of the average-of-awards rule as a point of fairness between stable and utopia imputations and provide a backward recurrence algorithm to compute it. To illustrate our analysis, we present an application to the distribution of CO2 emissions., Agencia Estatal de Investigación | Ref. PID2019‐106281GB‐I00, Agencia Estatal de Investigación | Ref. PID2021‐124030NB‐C33, Xunta de Galicia | Ref. ED481A 2021/325, Universidade de Vigo/CISUG
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

An operational toolbox for solving conflicting claims problems

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
A conflicting claims problem arises when a group of agents have claims over a resource that add up to more than it is available. Typical situations are the division of property among heirs, bankruptcy problems, tax distribution, or the global emissions budget. This paper introduces the R package ClaimsProblems, a toolbox for computing and comparing the central division rules introduced in the literature. The software can be used by researchers and managers interested in problems concerning the allocation of scarce resources., Agencia Estatal de Investigación | Ref. PID2019‐106281GB‐I00, Agencia Estatal de Investigación | Ref. PID2021‐124030NB‐C33, Xunta de Galicia | Ref. ED481A 2021/325
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Tesis doctoral (DoctoralThesis)

Computation and comparison of division rules to adjudicate conflicting claims, Cálculo y comparación de reglas de reparto para adjudicar reclamaciones en conflicto, Cálculo e comparación de regras de repartición para adxudicar reclamacións en conflicto

  • Núñez Lugilde, Iago
The general objective of this thesis project is to compare different division rules in claims problems (applicable also to tax distribution and rationing problems), using two main approaches: through the properties that verify the different rules (with their axiomatic characterisations) and with newer methods, by means of centrality or discrepancy measures. The core-center (centroid of the core of a cooperative game), a solution concept that treats all the stable distributions of the problem equally, will be studied in detail. Computational algorithms for this new solution will be provided and it will be justified that it satisfies a considerable number of properties that make it suitable for inclusion in the inventory of rules. This new rule and those already existing in the literature will be programmed in a package in R developing computationally efficient methods for the computation. In addition, the package will include the methodological advances developed in the theoretical work that will allow comparisons to be made between the different rules. Situations in which certain agents have priority over the rest, in the context of cooperative games in general, will also be studied using claims problems as a tool., El objetivo general de este proyecto de tesis es comparar distintos métodos de reparto en problemas de demandas (aplicable también a problemas de reparto de impuestos y de racionamiento), utilizando dos enfoques principalmente: a través de las propiedades que verifican las distintas reglas (con sus caracterizaciones axiomáticas) y con métodos más nuevos, por medio de medidas de centralidad o discrepancia. Se estudiará en detalle el core-center (centroide del núcleo de un juego cooperativo), concepto de solución que trata de forma ecuánime a todas los repartos estables del problema. Se proporcionarán algoritmos de cálculo para esta nueva solución y se justificará que cumple un considerable número de propiedades que hacen que pueda ser incluida en el inventario de reglas. En un paquete de R se programará esta nueva regla y las ya existentes en la literatura, desarrollando métodos computacionales eficientes para el cálculo. Además, el paquete incluirá los avances metodológicos desarrollados en los trabajos teóricos que permitirán establecer comparaciones entre las distintas reglas. Se estudiarán también situaciones, en el contexto de juegos cooperativos en general, en las que ciertos agentes tienen prioridad sobre el resto, utilizando los problemas de demandas como herramienta., O obxectivo xeral deste proxecto de tese é comparar distintos métodos de repartición en problemas de demandas (aplicable tamén a problemas de repartición de impostos e de racionamento), utilizando dous enfoques principalmente: a través das propiedades que verifican as distintas regras (coas súas caracterizacións axiomáticas) e con métodos máis novos, por medio de medidas de centralidade ou discrepancia. Estudarase en detalle o core-center (centroide do núcleo dun xogo cooperativo), concepto de solución que trata de forma ecuánime a todas as reparticións estables do problema. Propocionaranse algoritmos de cálculo para esta nova solución e xustificarase que cumpre un considerable número de propiedades que fan que poda ser incluida no inventario de regras. Nun paquete de R programarase esta nova regra e as xa existentes na literatura, desenvolvendo métodos computacionais eficientes para o cálculo. Ademáis, o paquete incluirá os avances metodolóxicos desenrolados nos traballos teóricos que permitirán establecer comparacions entre as distintas regras. Estudaranse tamén situacións, no contexto de xogos cooperativos en xeral, nas que certos axentes teñen prioridade sobre o resto, utilizando os problemas de demandas como ferramenta., Xunta de Galicia | Ref. ED481A 2021/325, Xunta de Galicia | Ref. ED431 C2016-040, Xunta de Galicia | Ref. ED431C 2020/03, Agencia Estatal de Investigación | Ref. PID2019-106281GB-I00, Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

On the computation of the shapley value and the random arrival rule

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
The Shapley value is one of the most important solution concept in game theory. Since its formulation involves an exponentially large number of terms, computing the exact Shapley value for large-scale games is computationally intractable. Based on the linearity of the Shapley value, we present an algorithm to calculate this value and we applied it to obtain the random arrival rule for a claims problem., Agencia Estatal de Investigación | Ref. PID2021-124030NB-C33, Agencia Estatal de Investigación | Ref. PID2019-106281GB-I00, Xunta de Galicia | Ref. ED481A 2021/325
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

The average-of-awards rule for claims problems

  • Mirás Calvo, Miguel Ángel
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUG, Given a claims problem, the average-of-awards rule (AA) selects the expected value of the uniform distribution over the set of awards vectors. The AA rule is the center of gravity of the core of the coalitional game associated with a claims problem, so it corresponds to the core-center. We show that this rule satisfies a good number of properties so as to be included in the inventory of division rules. We also provide several representations of the AA rule and a procedure to compute it in terms of the parameters that define the problem., Agencia Estatal de Investigación | Ref. MTM2017-87197-C3-2-P, Agencia Estatal de Investigación | Ref. PID2019-106281GB-I00
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Refining the Lorenz‐ranking of rules for claims problems on restricted domains

  • Mirás Calvo, Miguel Ángel
  • Núñez Lugilde, Iago
  • Quinteiro Sandomingo, Maria Del Carmen
  • Sánchez Rodríguez, María Estela
The comparison of the central rules for claims problems, according to the Lorenz order, has been studied not only on the entire set of problems but also on some restricted domains. We provide new characterizations of the adjusted proportional rule as being Lorenz‐maximal or Lorenz‐minimal within a class of rules on the half‐domains. Using this result, we rank the adjusted proportional, the minimal overlap, and the average‐of‐awards rules by analyzing whether or not these rules satisfy progressivity and regressivity on the half‐domains. We also find that the adjusted proportional rule violates two well‐known claim monotonicity properties., Agencia Estatal de Investigación | Ref. PID2019‐106281GB‐I00, Agencia Estatal de Investigación | Ref. PID2021‐124030NB‐C33, Xunta de Galicia | Ref. ED481A 2021/325, Universidade de Vigo/CISUG