10 research outputs found
Analysis of Nonlinear Duopoly Game: A Cooperative Case
We make further attempts to investigate equilibrium stability of a nonlinear Cournot duopoly game. Our studies in this paper focus on the cooperation that may be obtained among duopolistic firms. Discrete time scales under the assumption of unknown inverse demand function and linear cost are used to build our models in the proposed games. We introduce and study here an adjustment dynamic strategy beside the so-called tit-for-tat strategy. For each model, the stability analysis of the fixed point is analyzed. Numerical simulations are carried out to show the complex behavior of the proposed models and to point out the impact of the models’ parameters on the cooperation
“Nonstationary Analysis of Circuit-Switched Communication Networks
Circuit-switched communication networks have been analyzed extensively in the
stationary case, i.e. where the arrival and/or service rates are time-independent. In this
paper, we study a circuit-switched network where the external arrival rates to the
network are time-dependent functions. The circuit-switched network is modelled as a
nonstationary queueing network with population constraints, which is analyzed
approximately in order to obtain the blocking probability functions. Using this method
we model two circuit-switched networks, namely, a traffic-groomed tandem optical
network and a single-orbit LEO satellite network
Analysis of Nonlinear Duopoly Game: A Cooperative Case
We make further attempts to investigate equilibrium stability of a nonlinear Cournot duopoly game. Our studies in this paper focus on the cooperation that may be obtained among duopolistic firms. Discrete time scales under the assumption of unknown inverse demand function and linear cost are used to build our models in the proposed games. We introduce and study here an adjustment dynamic strategy beside the so-called tit-for-tat strategy. For each model, the stability analysis of the fixed point is analyzed. Numerical simulations are carried out to show the complex behavior of the proposed models and to point out the impact of the models' parameters on the cooperation
Generalized OWA operators for uncertain queuing modeling with application in healthcare
The weighted averaging operators are one of the popular methods for aggregating information. In recent years, ordered weighted averaging operators (OWA) have attained a great attention by researchers. These OWA operators due to their versatility are very useful to model many real world situations. Several extensions of OWA operators are presented in the literature which can handle a situation with uncertainty. Although many queuing models have been proposed in numerous healthcare studies, the inclusion of OWA operators is still rare. In this research study, we propose a novel method using the uncertain generalized ordered weighted average and illustrate its application to the uncertain queue modeling in a hospital emergency room; where incoming flux of patients and the required level of service for each patient is unknown and uncertain. The model with multilateral decision making process has been described which will provide several alternatives to decision makers to select the best alternative for their challenging situations. The proposed method has resulted an improved performance of the queuing system, increased customer satisfaction as well as a significant reduction in the operational cost. This study will enable decision makers to operate a flexible and cost-effective system in the event of uncertainty, uncontrollable and unpredicted situations
Probabilistic OWA distances applied to asset management
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. Average distances are widely used in many fields for calculating the distances between two sets of elements. This paper presents several new average distances by using the ordered weighted average, the probability and the weighted average. First, the work presents the probabilistic ordered weighted averaging weighted average distance (POWAWAD) operator. POWAWAD is a new aggregation operator that uses distance measures in a unified framework between the probability, the weighted average and the ordered weighted average (OWA) operator that considers the degree of importance that each concept has in the aggregation. The POWAWAD operator includes a wide range of particular cases including the maximum distance, the minimum distance, the normalized Hamming distance, the weighted Hamming distance and the ordered weighted average distance (OWAD). The article also presents further generalizations by using generalized and quasi-arithmetic means forming the generalized probabilistic ordered weighted averaging weighted average distance (GPOWAWAD) operator and the quasi-POWAWAD operator. The study ends analysing the applicability of this new approach in the calculation of the average fixed assets. Particularly, the work focuses on measuring the average distances between the ideal percentage of fixed assets that the companies of a specific country should have versus the real percentage of fixed assets they have. The illustrative example focuses on the Asian market