In this paper an algorithm is presented to compute all Nash equilibria for games in normal form on the only premises that the number of Nash equilibria is finite. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of...

Although explicitly installed as a transitory body, the Dutch telecommunication controller OPTA displays the typical signs of government institutions that seek to become indispensable. A conflict in OPTA''s two main policy objectives – guarding consumer prices through controlling the network...

No abstract available

We describe a genetic algorithm for the partial constraint satisfaction problem. The typical elements of a genetic algorithm, selection, mutation and cross-over, are filled in with combinatorial ideas. For instance, cross-over of two solutions is performed by taking the one or two domain...

In this paper we study and compare the properties of several bootstrap unit root tests recently proposed in the literature. The tests are Dickey-Fuller or Augmented DF-tests, either based on residuals from an autoregression and the use of the block bootstrap (Paparoditis & Politis, 2003) or on...

Two important aspects of network structure are network density and network centrality. These two aspects highlight different characteristics of a network. Empirical studies tend to find that one or the other is the better explanatory variable for certain aspects of corporate behaviour. This note...

This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial- time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization....

This paper considers the ATM Network Installation Problem on a tree. To install such a communication network, decisions concerning the location of hardware devices, the capacity installation on links, and the routing of demands have to be made simultaneously. The problem is shown to be NP-hard....