Values of games with weighted graphs

González–Arangüena, Enrique; Manuel, Conrado; Pozo, Mónica del

doi:10.1016/j.ejor.2014.11.033

Cited by 11 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this technique is only beneficial when plotting routes through an infrastructure. A more efficient way is focusing on the flows between the links in the infrastructure, which assigns weights based on existing flow (Gonzalez-Aranguena et al, 2014).…”

Section: Cooperative Game Theory In Interdependent Infrastructuresmentioning

confidence: 99%

“…For the transportation network, average annual daily traffic or network measures can be used to simulate traffic flow in each link/road. Thus, (α) R C can be calculated as follows (see Gonzalez-Aranguena et al, 2014):…”

Section: Restricted Weighted Graphsmentioning

confidence: 99%

“…(5) Gonzalez-Aranguena et al (2014) demonstrated that the α-weighted restricted graph is decomposable on unanimity games. Hence, the modified characteristic function for the restricted weighted graph is…”

Section: Restricted Weighted Graphsmentioning

confidence: 99%

“…This calculation method does not consider the characteristics of the nodes, though. An important feature of each node in the water or transportation infrastructures is the maximum capacity of flow (Gonzalez-Aranguena et al, 2014). For instance, the daily amount of pumping water for a pump station varies, and the importance of this element to the surrounding area is related to the amount of flow the pump services.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Decentralized resource allocation for interdependent infrastructures resilience: a cooperative game approach

Mohebbi

Barnett

Aslani

2021

Int Trans Operational Res

View full text Add to dashboard Cite

Interdependent critical infrastructures are governed by several sectors working together to maintain social, economic, and environmental well-being. Although many models focus on a centralized view for networks for the restoration planning of these networks, rarely is there only one decision maker for the infrastructure networks. In the decentralized decision-making paradigm, individual decision makers need to decide how to prioritize areas of the network and eventually improve the aggregated infrastructure systems resilience. There is a dearth of quantitative studies analyzing resource allocation decisions considering both decentralized and cooperative aspects. This paper aims to propose a coalitional game theory approach to address decentralized resource allocation for interdependent water distribution and road networks. In particular, combining coalitional game theory with weighted graphs creates an order of repair for each node in the coalitions. Subsequently, the decision makers can pass the information on to the master problem, reducing the complexity of the resource allocation problem for the interdependent networks. The proposed approach is applied to water distribution and transportation networks in the City of Tampa, Florida. We compare the decentralized solutions to centralized solutions in different scenarios to demonstrate the feasibility of our approach for the city-scale networks. The results indicated the superiority of the proposed framework in terms of computational time and solution quality.

show abstract

Section: Cooperative Game Theory In Interdependent Infrastructuresmentioning

confidence: 99%

Section: Restricted Weighted Graphsmentioning

confidence: 99%

Section: Restricted Weighted Graphsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Decentralized resource allocation for interdependent infrastructures resilience: a cooperative game approach

Mohebbi

Barnett

Aslani

2021

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…In a weighted network, the links have values assigned to them, in order to represent for example the level of proximity or trust between players. Probabilistic graphs have also been considered for communication games where the value of a link ij corresponds to the probability that the agents i and j can communicate directly (Calvo et al [1999]; González-Arangüena et al [2015]). Notions that generalize communication networks, in particular conference structures 6 (Myerson [1980]), and hypergraphs (van den Nouweland et al [1992]) have also been considered.…”

Section: Communication Gamesmentioning

confidence: 99%

Allocation Rules for Networks Inspired by Cooperative Game-Theory

Caulier¹,

Skoda²,

Tanimura³

2017

Revue d'Économie Politique

View full text Add to dashboard Cite

Distribution électronique Cairn.info pour Dalloz. © Dalloz. Tous droits réservés pour tous pays.La reproduction ou représentation de cet article, notamment par photocopie, n'est autorisée que dans les limites des conditions générales d'utilisation du site ou, le cas échéant, des conditions générales de la licence souscrite par votre établissement. Toute autre reproduction ou représentation, en tout ou partie, sous quelque forme et de quelque manière que ce soit, est interdite sauf accord préalable et écrit de l'éditeur, en dehors des cas prévus par la législation en vigueur en France. Il est précisé que son stockage dans une base de données est également interdit.

show abstract