Showing 1 - 10 of 16,873
We analyze a model of endogenous two-sided network formation where players are affected by uncertainty in their … inefficient networks such as the empty network. On the other hand, it may include networks with unreciprocated, one-way links …, which comes with an efficiency loss as linking efforts are costly. We characterize equilibria under ambiguity and provide …
Persistent link: https://www.econbiz.de/10013336333
This paper introduces a formulation of the optimal network compression problem for financial systems. This general … formulation is presented for different levels of network compression or rerouting allowed from the initial inter-bank network. We … systematic shocks to the financial network. We conclude by studying the optimal compression problem for specific networks; this …
Persistent link: https://www.econbiz.de/10012825191
This paper analyzes convex congestion network problems. It is shown that for network problems with convex congestion … costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition …. Furthermore, an easy way of determining if a given network is optimal is provided …
Persistent link: https://www.econbiz.de/10014069993
This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that …
Persistent link: https://www.econbiz.de/10011526540
The paper presents an extended version of the consumer choice problem. Different from the standard model, prices are not fixed but arise from Walrasian interactions of total demand and a stylized supply function for each of the goods. Three different types of evolutionary algorithms are set up...
Persistent link: https://www.econbiz.de/10011526771
This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed...
Persistent link: https://www.econbiz.de/10014040268
The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...
Persistent link: https://www.econbiz.de/10014116698
We propose a new, highly effective and easy-to-implement algorithm for solving large-scale mean-variance optimization problems --- with weight upper bound constraints and without short sales --- when the size of mean-variance portfolios is much smaller than the number of assets, which is almost...
Persistent link: https://www.econbiz.de/10013308810
Persistent link: https://www.econbiz.de/10012102758
Persistent link: https://www.econbiz.de/10011687173