We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

The ability to accurately estimate the extent to which the failure of a bank disrupts the financial system is very valuable for regulators of the financial system. One important part of the financial system is the interbank payment system. This paper develops a robust measure, SinkRank, that...

This paper explores the impact of digital technologies on the nature and routine intensity of shopfloor work, the ways in which digital technologies exert their effects and the factors moderating the outcomes of digitalisation in respect of work. The effect of technology cannot be limited to a...

The problem of designing, coordinating, and managing complex systems has been central to the management and organizations literature. Recent writings have tended to offer modularity as, at least, a partial solution to this design problem. Two unifying themes characterize the extant literature on...

This paper develops a practical approach to estimate the benefits of improved reliability of road networks. We present a general methodology to estimate the (changes in) scheduling costs due to (changes in) travel time variability for car travel. We focus on situations where only mean delays are...

This paper studies inventory constraints in a machine scheduling environment. Jobs can add and remove items of different types to the inventory and from the inventory, respectively. Jobs removing items cannot be processed if the required amount of items is not available. We first have a look at...

Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...

NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...

We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows...

A well known and simple game to model markets is the glove game where worth is produced by building matching pairs. For glove games, different concepts, like the Shapley value, the restricted Shapley value or the Owen value, yield diff erent distributions of worth. Moreover, computational effort...