In the widely used class of multidimensional poverty measures introduced by Alkire and Foster (2011), dimension-specific weights combined with a single cut-off parameter play a fundamental role in identifying who is multidimensionally poor. This paper revisits how these parameters are...

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...

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...

This paper builds upon a view of economic system and individual economic organization as problem-solving arrangements and presents a simple model of adaptive problem-solving driven by trial-and-error and collective selection. The institutional structure, and in particular its degree of...

This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.

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...

Collecting and processing large amounts of data is becoming increasingly crucialin our society. We model this task as evaluating a function f over a large vector x =(x1,...,xn), which is unknown, but drawn from a publicly known distribution X. In our model, learning each component of the input x...