تم في هذا البحث اقتراح خوارزمية بزمن خطي لإيجاد الاستراتيجية المثالية في نظرية الألعاب المستقرة, التي تكون قيمة اللعبة ف, أي يتساوى في هذه اللعبة الثمن الأدنى مع الثمن الأقصى للعبة, تعتمد هذه الخوارزمية على مبدأ حذف الاستراتيجيات غير المربحة أو الاستراتيجيات التي تكون المنفعة من تبنيها أقل من المنفعة فيما لو تبنينا استراتيجية أخرى. و الهدف من ذلك هو سهولة حساب توازن ناش و نقاط الاستقرار و الوصول إلى حل مثالي للعبة.
In this research proposal a time linear algorithm to find the
optimal strategy in Stable game theory, that the value of game is
fixed number, where the lower Value Game and the upper Value
Game are equal. this algorithm is based on the principle of nonprofitable
delete strategies or strategies that are utility to adopt less
utility if we adopt another strategy. The goal is to ease the expense
of Nash equilibrium and stability points and access to optimal
solution for the game.
References used
Abraham. I, Alvisi. L, and . Halpern. J, : Distributed Computing Meets Game Theory: Combining Insights From Two Fields", ACM SIGACT News 69, vol. 42, no. 2, June 2011
Almanasra. S, Suwais. K and Arshad M.R, " Adaptive automata model for learning opponent behavior based on genetic algorithms", Scientific esearch and Essays Vol. 7(42), pp. 3609 - 3620, 31 October, 2012
Freund. Y and Schapire. R "Game Theory, On-line Prediction and Boosting" , Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996
In this paper, we propose an efficient strategy for calculating
quasi-optimal stepsizes for the Givens-parameterized deflationary
ICA algorithm, DelLR.
There has been a clear and rapid development in signal processing systems,
this development comes as a result of the availability of modern techniques
in electronic systems and also as a result of achieving mathematical
algorithms which were effec
The current random behavior of stakeholders within the Al-Abrash river basin in Syrian coastal region, the lake and the river, threatens more than ever to pollute the whole basin. The goal of this paper is to address the state of shared management of
Operational research science aims to find the optimal solution
to many problems in various life domains. One of the most famous
is the network analysis. Problem. In this paper we introduce an
effective algorithm with linear time O ( n + k ) within it all network
activities are executed within determined period and with a
minimum cost.
The all-nodes shortest paths problem is undoubtedly one of
the most basic problems in algorithmic graph theory. In this paper,
we introduce simple and efficient algorithm for all nodes shortest
paths problem for directed (undirected) graphs. In th