Exploring new directions for research in problem structuring methods: on the role of cognitive style

Prior research has argued that cognitive style can have a significant impact on group decision making. In addition, several scholars have proposed that cognitive style can play a key role in the design and use of group decision support systems. However, cognitive style has not received a great deal of attention in the problem structuring methods (PSMs) community. This is surprising, given that PSMs are specifically developed to support a group in their decision making. The purpose of this paper is thus to examine the significance of cognitive style within PSMs. The paper identifies and explores the role of four different cognitive style functions in problem structuring interventions. This analysis is carried out by focusing on the different tasks embedded within a group process supported by PSMs. Implications for the research and practice of PSMs are then discussed.     

Harmonic Algebraic Curves and Noncrossing Partitions

Motivated by Gauss's first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing matching arises from some harmonic curve, and deduce from this that every basketball arises from some polynomial.     

At Least n – 1 Intersection Points in a Connected Family of n Unit Circles in the Plane

Let C be a family of n different unit circles in the plane. We show that C determines at least n - c intersection points, where c is the number of connected components in ∪_{C ∈ C}C. This proves a conjecture of A. Bezdek.     

Discrete-time GI/Geo/1 queue with multiple working vacations

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.      

Technical efficiency,managerial efficiency and objective-setting in the educational system: an international comparison

This study uses data envelopment analysis to analyse the efficiency of educational systems in 31 countries. This type of evaluation is of interest both when formulating a model for analysis and when applying such a model empirically. The efficiency of an educational system must take into account the students' economic and social background, as this is an environmental factor that decisively influences their performance. This is a highly important aspect and so we propose a specific evaluative process for it. Secondly, we evaluate the efficiency of educational systems in different countries, an analysis that has few forerunners since the majority of previous research has focused on analysing a single country. The results suggest that, in general, the most efficient management of educational systems can be found in those countries with a Communist past. They also suggest that there is a series of developed countries, which, judging by the results obtained, could increase their students' performance with even fewer resources than those currently allocated to their educational systems.     

Optimal asset allocation for pension funds under mortality risk during the accumulation and decumulation phases

In a financial market with one riskless asset and n risky assets whose prices are lognormal, we solve in a closed form the problem of a pension fund maximizing the expected CRRA utility of its surplus till the (stochastic) death time of a representative agent. We consider a unique asset allocation problem for both accumulation and decumulation phases. The optimal investment in the risky assets must decrease during the first phase and increase during the second one. We accordingly suggest it is not optimal to manage the two phases separately, and outsourcing of allocation decisions should be avoided in both phases. JEL: G23, G11 MSC 2000: 62P05, 91B28, 91B30, 91B70, 93E20     

A rule-based risk decision-making approach and its application in China's customs inspection decision

This paper addresses a kind of risk decision-making problem existing widely in public administration and business management, which is characterized by (1) occurrence probabilities of states of nature can be estimated by analysing historical observations, but historical observations of different objects are unhomogeneous, (2) the relation between observations and occurrence probabilities of states of nature are affected by some qualitative and quantitative indicators, (3) it is a real-time decision-making problem, that is, there are many decisions for different objects to be made in a limited time, (4) considering decision's execution, impact of resource constrains is an important issue in decision-making process. In this paper, we develop a rule-based approach to address the problem. In the proposed approach, a two-step clustering method is employed to classify objects into categories, and observations in each category can be approximately viewed as homogeneous. For objects in each category, occurrence probabilities of states of nature are estimated by logistic regression, and the decision rule is obtained through solving an optimization model, which is to minimize the total decision risks while satisfying resource constrains. Effect and efficacy of our approach are illustrated through its application to China's customs inspection decision.     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

An Enhancement of the Drezner—Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance

In this note, we examine the algorithm of Drezner and Wesolowsky for locating a facility with maximin rectilinear distance to a given set of demand points. The concept of the closest-point constraint is introduced as a technique for increasing the efficiency of the algorithm. This potential increase in efficiency is demonstrated by an example.