Country: Netherlands

Found 18376 papers in total
Credible equilibria in non-finite games and in games without perfect recall
Credible equilibria in non-finite games and in games without perfect recall
1998,
Credible equilibria were defined in Ferreira et al . to handle situations of...
Unilateral commitment in the finitely repeated prisoners’ dilemma
Unilateral commitment in the finitely repeated prisoners’ dilemma
1998,
In this paper, we modify the finitely repeated prisoners’ dilemma by adding an...
Two-person non-zero-sum games as multicriteria goal games
Two-person non-zero-sum games as multicriteria goal games
1998,
In this paper, we propose a new way to analyze bimatrix games. This new approach...
Cooperative solutions in an economic growth game
Cooperative solutions in an economic growth game
1998,
A differential game with workers and capitalists as players is considered. The players...
On the structure of the set of Nash equilibria of weakly nondegenerate bimatrix games
On the structure of the set of Nash equilibria of weakly nondegenerate bimatrix games
1998,
In two-person games where each player has a finite number of pure strategies, the set...
Constrained games, intervening duality and experimenter–experiment interactions
Constrained games, intervening duality and experimenter–experiment interactions
1998,
In a previous paper I introduced the idea of intervening duality with a context of...
Axioms for the Shapley value on convex geometries
Axioms for the Shapley value on convex geometries
1998,
The purpose of this article is an extension of Shapley's value for games with...
Computational implementation of Fujishige's graph realizability algorithm
Computational implementation of Fujishige's graph realizability algorithm
1998,
Fujishige's PQ-graph algorithm is one of the most computationally efficient algorithms...
The line index and minimum cut of weighted graphs
The line index and minimum cut of weighted graphs
1998,
In this paper we discuss the line index and the minimum capacity, sum of the weights...
Simulated annealing for the unconstrained quadratic pseudo-Boolean function
Simulated annealing for the unconstrained quadratic pseudo-Boolean function
1998,
In this paper, we develop a simulated annealing (SA) based heuristic for the...
Iterative methods based on splittings for stochastic automata networks
Iterative methods based on splittings for stochastic automata networks
1998,
This paper presents iterative methods based on splittings (Jacobi, Gauss–Seidel,...
Planning the evolution to broadband access networks: A multicriteria approach
Planning the evolution to broadband access networks: A multicriteria approach
1998,
The interplay between continuing technical innovations, development of multifaceted...
Kohonen maps for solving a class of location–allocation problems
Kohonen maps for solving a class of location–allocation problems
1998,
Location–allocation problems occur whenever more than one facility need be...
Neural and delay based heuristics for the Steiner problem in networks
Neural and delay based heuristics for the Steiner problem in networks
1998,
High speed networks such as the B-ISDN must be adequately equipped to handle...
Neural networks for image and video compression: A review
Neural networks for image and video compression: A review
1998,
This paper examines much of the recent and/or important work in the field of neural...
Improved exploration in Hopfield network state–space through parameter perturbation driven by simulated annealing
Improved exploration in Hopfield network state–space through parameter perturbation driven by simulated annealing
1998,
An approach is presented for treating discrete optimization problems mapped on the...
Distribution network optimization: Finding the most economic solution by using genetic algorithms
Distribution network optimization: Finding the most economic solution by using genetic algorithms
1998,
The problem of finding the optimal features in a distribution network is approached...
Benchmarks for shop scheduling problems
Benchmarks for shop scheduling problems
1998,
In this paper we present extensive sets of randomly generated test problems for the...
Random sequencing jobs with deadlines problem: Growth of the optimal solution values
Random sequencing jobs with deadlines problem: Growth of the optimal solution values
1998,
In the paper an asymptotic value of the sequencing jobs with deadlines (SJD) problem...
A model of clinker capacity expansion
A model of clinker capacity expansion
1998,
This paper describes a model which has been applied in practice to determine an...
Probability distributions of cost, revenue and profit over a warranty cycle
Probability distributions of cost, revenue and profit over a warranty cycle
1998,
A warranty cycle starts with the sale of a new item and terminues when the warranty...
Solving the generalised assignment problem using polyhedral results
Solving the generalised assignment problem using polyhedral results
1998,
The Generalised Assignment Problem (GAP) consists of finding a maximal profit...
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
1998,
This paper presents a new branch-and-bound algorithm for solving the quadratic...
Economic spare capacity planning for Digital Cross-Connect System mesh-restorable networks
Economic spare capacity planning for Digital Cross-Connect System mesh-restorable networks
1998,
This paper considers an integer programming (IP) based optimization algorithm to solve...
Papers per page: