In this paper we de2ne and study some solution concepts for games in which there does not have to be total cooperation between the players. In particular, we show the relations of these solution concepts with the selectope. In this way, we extend the work of Derks, Haller and Peters, METEOR Research Memorandum, Maastricht, RM=97=016 (revised version, 1998). c © 2000 Elsevier Science B.V. All ri...

Quantum cryptography could be integrated in various existing concepts and protocols to secure communications that require very high level of security. The aim of this paper is to analyse the use of quantum cryptography within PPP. We introduce basic concepts of the Point to Point Protocol; we propose a solution that integrates quantum key distribution into PPP. An example is given to demonstrat...

Most standard solution concepts of extensive games are history-insensitive in the sense that no matter at which information set one is, it is assumed that each player believes that everybody else is rational. In reality, each history of moves reveals certain traits of the players to one another. It is argued in this paper that solution concepts ought to make use of this fact. An example of such...

This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...

Data Structures and Algorithms is a module in most Computer Science or Information Technology curricula. It is one of the modules most students identify as being difficult. This paper demonstrates how programming a solution for Sudoku can make abstract concepts more concrete. The paper relates concepts of a typical Data Structures and Algorithms module to a step by step solution for Sudoku in a...

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational problems associated with many of these solution concepts tend to be intractable—NP-hard or worse. In this paper, we incorporate complexity measures recently...

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

in this paper, we intend to solve special kind of ordinary differential equations which is called heun equations, by converting to a corresponding stochastic differential equation(s.d.e.). so, we construct a stochastic linear equation system from this equation which its solution is based on computing fundamental matrix of this system and then, this s.d.e. is solved by numerically methods. mo...

Brain networks are increasingly understood as one of a large class of information processing systems that share important organizational principles in common, including the property of a modular community structure. A module is topologically defined as a subset of highly inter-connected nodes which are relatively sparsely connected to nodes in other modules. In brain networks, topological modul...

Several computational and mathematical features of the h-p cloud method are demonstrated in this paper. We show how h, p and h-p adaptivity can be implemented in the h-p cloud method without traditional grid concepts typical of finite element methods. The mathematical derivation of an a posteriori error estimate for the h-p cloud method is also presented. Severalnumerical examples illustrate th...