نتایج جستجو برای: maximin method

تعداد نتایج: 1630602  

Journal: :Mathematical Social Sciences 2018

Journal: :Computers & Operations Research 2021

Hiring is a fundamental, frequent activity for all organizations. decisions have been reported to be subject conscious and unconscious biases in the literature. The field of Computational Ethics aims quantify maximize ethicality decisions. This paper attempts apply shortlisting process hiring through use Linear Programming. Given set applicants job with numerical qualification values, author de...

Journal: :Social Choice and Welfare 2016
Lionel Page Daniel G. Goldstein

We investigate whether beliefs about the income distribution are associated with political positions for or against redistribution. Using a novel elicitation method, we assess individuals’ beliefs about the shape of the income distribution in the United States. We find that beliefs about inequality, measured in terms of income dispersion, play only a marginal role in political positions as well...

Journal: :Annals OR 2002
Horst W. Hamacher Martine Labbé Stefan Nickel Anders J. V. Skriver

Locating a facility is often modeled as either the maxisum or the minisum problem, re ecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g. an airport. This can be modeled as a multicriteria network location problem, where some of the sumobjectives are maximized (push e ect) and some of the sum-objectiv...

Journal: :Social Choice and Welfare 2021

We propose a new method, that we call an allocation perturbation, to derive the optimal nonlinear income tax schedules with multidimensional individual characteristics on which taxes cannot be conditioned. It is well established that, when individuals differ in terms of preferences top their skills, marginal rates can negative. In contrast, show heterogeneous behavioral responses and one has po...

2006
Richard J. Hathaway James C. Bezdek Jacalyn M. Huband

Most iterative clustering algorithms require a good initialization to achieve accurate results. A new initialization procedure for all such algorithms is given that is exact when the data contain compact, separated clusters. Our examples use c-means clustering.

2003
CEES WITHAGEN GEIR B. ASHEIM C. WITHAGEN G. B. ASHEIM W. BUCHHOLZ

Is Hartwick’s rule a necessary condition for maximin in Solow’s [1974] model? Until recently this has been an open question; this is surprising given the prominence of the model. Cairns and Yang [2000] as well as Withagen, Asheim and Buchholz (this issue) claim that the answer is in the affirmative and claim to provide a formal proof. The latter team argues that the proof by the former is not c...

2006
V. Roshan Joseph Ying Hung YING HUNG

A randomly generated Latin hypercube design (LHD) can be quite structured: the variables may be highly correlated or the design may not have good space-filling properties. There are procedures for finding good LHDs by minimizing the pairwise correlations or by maximizing the inter-site distances. In this article we show that these two criteria need not be in close agreement. We propose a multi-...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید