نتایج جستجو برای: borda

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

2012
Travis C. Service Julie A. Adams

This paper considers the communication complexity of approximating common voting rules. Both upper and lower bounds are presented. For n voters and m alternatives, it is shown that for all ∈ (0, 1), the communication complexity of obtaining a 1− approximation to Borda is O(log( 1 )nm). A lower bound of Ω(nm) is provided for fixed small values of . The communication complexity of computing the t...

Journal: :Social Choice and Welfare 2008
Clemens Puppe Attila Tasnádi

* We thank József Mala for posing the question of Nash implementability on restricted domains that led to this research. We are very grateful to two anonymous referees and an associate editor for their helpful comments and suggestions. The second author gratefully acknowledges financial support from the Hungarian Academy of Sciences (MTA) through the Bolyai János research fellowship. Summary. W...

2008
Anna Bassi

This paper presents experiments analyzing the strategic behavior of voters under three voting systems: plurality rule, approval voting, and the Borda count. Strategic behavior is significantly different under each treatment (voting system). Plurality rule leads voters to play in a more sophisticated manner, but not necessarily insincerely, displaying the lowest levels of manipulation. The oppos...

Journal: :CoRR 2011
Jessica Davies George Katsirelos Nina Narodytska Toby Walsh

We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin ...

Journal: :Social Choice and Welfare 2016

2015
Steven J. Brams Marc Kilgour Christian Klamler

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score, of the items received by a player. Although SA...

2015
Amir Viyanchi Hamid Reza Rasekh Ali Rajabzadeh Ghatari Hamid Reza SafiKhani

Decision-making for medicines to be accepted in Iran's public health insurance reimbursement list is a complex process and involves factors, which should be considered in applying a coverage for medicine costs. These processes and factors are not wholly assessed, while assessment of these factors is an essential need for getting a transparent and evidence-based approach toward medicine reimburs...

Journal: :international journal of environmental research 2010
m. gharakhlou h.a. faraji sabokbar s. givehchi

having access to locations struck by natural environmental disasters is one of the chief necessities in urban disaster management. this paper aims to study different physical and semi-physical patterns for increasing access to different districts in a city through applying changes to the present network of routes. to attain this goal, district 6 of tehran municipality was selected for the case ...

Journal: :Anales del Instituto de Investigaciones Estéticas 2012

2014
José Manuel Gutiérrez

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

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