721 research outputs found
Cases in Cooperation and Cutting the Cake
Cooperative game;sharing problem
Operations Research Games: A Survey
This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved.Cooperating players not only face a joint optimisation problem in trying, e.g., to minimise total joint costs, but also face an additional allocation problem in how to distribute these joint costs back to the individual players.This interplay between optimisation and allocation is the main subject of the area of operations research games.It is surveyed on the basis of a distinction between the nature of the underlying optimisation problem: connection, routing, scheduling, production and inventory.cooperative games;operational research
Efficient computation of the Shapley value for game-theoretic network centrality
The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in networks. However, although this approach has a variety of real-world applications (including social and organisational networks, biological networks and communication networks), its computational properties have not been widely studied. To date, the only practicable approach to compute Shapley value-based centrality has been via Monte Carlo simulations which are computationally expensive and not guaranteed to give an exact answer. Against this background, this paper presents the first study of the computational aspects of the Shapley value for network centralities. Specifically, we develop exact analytical formulae for Shapley value-based centrality in both weighted and unweighted networks and develop efficient (polynomial time) and exact algorithms based on them. We empirically evaluate these algorithms on two real-life examples (an infrastructure network representing the topology of the Western States Power Grid and a collaboration network from the field of astrophysics) and demonstrate that they deliver significant speedups over the Monte Carlo approach. Fo
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Using a distributed Shapley-value based approach to ensure navigability in a social network of smart objects
The huge number of nodes that is expected to join
the Internet of Things in the short term will add major scalability
issues to several procedures. A recent promising approach to
these issues is based on social networking solutions to allow
objects to autonomously establish social relationships. Every
object in the resulting Social IoT (SIoT) exchanges data with
its friend objects in a distributed manner to avoid the need
for centralized solutions to implement major functionalities,
such as: node discovery, information search and trustworthiness
management. However, the number and types of established
friendship affects network navigability. This paper addresses this
issue proposing an efficient, distributed and dynamic strategy for
the objects to select the right friends for the benefit of the overall
network connectivity. The proposed friendship selection model
relies on a Shapley-value based algorithm mapping the friendship
selection process in the SIoT onto the coalition formation problem
in a corresponding cooperative game. The obtained results show
that the proposed solution is able to ensure global navigability,
measured in terms of average path length among two nodes in
the network, by means of a distributed and wise selection of the
number of friend objects a node has to handle
Insinking: A Methodology to Exploit Synergy in Transportation
vehicle routing;cooperative games;retailing;insinking;Shapley Monotonic Path;Logistic Service Providers
Enhancing the navigability in a social network of smart objects: a Shapley-value based approach
The Internet of Things (IoT) holds the promise to interconnect any possible object capable of providing useful information about the physical world for the benefit of humans' quality of life. The increasing number of heterogeneous objects that the IoT has to manage introduces crucial scalability issues that still need appropriate solutions. In this respect, one promising proposal is the Social IoT (SIoT) paradigm, whose main principle is to enable objects to autonomously establish social links with each other (adhering to rules set by their owners). "Friend" objects exchange data in a distributed manner and this avoids centralized solutions to implement major functions, such as: node discovery, information search, and trustworthiness management. However, the number and types of established friendships affect network navigability. This issue is the focus of this paper, which proposes an efficient, distributed and dynamic solution for the objects to select the right friends for the benefit of the overall network connectivity. The proposed friendship selection mechanism relies on a game theoretic model and a Shapley-value based algorithm. Two different utility functions are defined and evaluated based on either a group degree centrality and an average local clustering parameter. The comparison in terms of global navigability is measured in terms of average path length for the interconnection of any couple of nodes in the network. Results show that the group degree centrality brings to an enhanced degree of navigability thanks to the ability to create a suitable core of hubs
- …