the performance evaluation and efficiency measurement of software companies and compare them together as a set of knowledge-based activities due to the unknown of internal processes and stages common to these companies and ignoring these processes in performance evaluation by data envelopment analysis models and how to consider these processes and procedures for calculating efficiency of each s...

ةصلاخلا بكرملل ةدیدج تاقتشم ریضحت ىلا ثحبلا يمری 4,3,1 ةیتلاا تلاعافتلا ءارجا للاخ نم لوزایادایاث : ًلاوأ : ب كرملل فیش ةدعاق ریضحت ) 2 و نیما 5 و تبكرم 4,3,1 لوزا یادایاث ( يلیفو یلكوینلا ضیو عتلا ءارجاو ةدعاقلل يرتسلاا ب كرملا نیو كت ى لا يدؤ یل مویدو صلا دیسكوثیا دو جوب ل ثیلاا تاتیسا ومورب عم ) 3 ( ، يذ لا یازاردیھلا عم ھتلعافم تمت ن 99 % د یازاردیھلا قتشم ریضحتل ) 4 ( فیش دعاوق نم د یدع...

In load balancing games, there is a set of available servers and a set of clients; each client wishes to run her job on some server. Clients are selfish and each of them selects a server that, given an assignment of the other clients to servers, minimizes the latency she experiences with no regard to the global optimum. In order to mitigate the effect of selfishness on the efficiency, we assign...

In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it exists, associates to each fuzzy coalition in the game an allocation of the coalitional worth satisfying the efficiency, the symmetry, and the null-player conditions. It determines a “cumulative value” that is the “su...

يديوتامورلا لصافلما باهتلا ضيرم180 ةساردلا تلمش :جئاتنلا عافترا نأ جئاتنلا ترهظأ .)اًماع 40.49±12.19 رمعلا طسوتم( يف LDL لدعم و )55.1%(لورتسلوكلا لدعم عافترا راشتنا لدعم عافترا ينب ةيئاصحإ ةوق تاذ ةقلاع دوجو نع تفشك .)51.2%( ىلع ةولاعو .)p=0.002( CRP لا هبسن عافترا و لورتسيلوكلا طاشنو يلكلا لورتسلوكلا ينب ةيباجيإ ةقلاع دوجو انظحلا ،كلذ طاقن رخآ ضرم ةكرتشلما اًماع 28 مادختساب اهسايق تم امك ،ضرلما ...

This short note demonstrates how one can define a transformation of a non-zero sum game into a zero sum, so that the optimal mixed strategy achieving equilibrium always exists. The transformation is equivalent to introduction of a passive player into a game (a player with a singleton set of pure strategies), whose payoff depends on the actions of the active players, and it is justified by the l...

We consider Cournot models of competition, where market participants choose the quantities they demand or supply. We study the loss of aggregate surplus due to the exercise of market power in Cournot competition, for both oligopsony and oligopoly models. We observe that efficiency loss is generally arbitrarily high in Cournot games, but also prove bounds on efficiency loss in several cases of i...

The main objective of this work is to improve the energy-efficiency (EE) of a multiple access channel (MAC) system, through power control, in a distributed manner. In contrast with many existing works on energy-efficient power control, which ignore the possible presence of a queue at the transmitter, we consider a new generalized cross-layer EE metric. This approach is relevant when the transmi...

This paper aims to establish a delayed dynamical relationship between payoffs of players in a zero-sum game. By introducing Markovian chain and time delay in the network model, a delayed game network model with sector bounds and slope bounds restriction nonlinear function is first proposed. As a result, a direct dynamical relationship between payoffs of players in a zero-sum game can be illustr...