In this paper we study the allocation of indivisible items among a group of agents, a problem which has received increased attention in recent years, especially in areas such as computer science and economics. A major fairness property in the fair division literature is proportionality, which is satisfied whenever each of the n agents receives at least [Formula: see text] of the value attached ...

In this paper we present an effective scheme that preserves the biometric templates more secured. We present a new algorithm called Enhanced Blind Encryption Algorithm for securing biometric templates between client and server and using that for authentication. There are four phases involved in this process namely, enrollment, identification, matching and fusion. During enrollment, biometric tr...

In this thesis, I present some novel results pertaining to the relationship between two popular and interesting information aggregation methods: the Condorcet and Borda tallies. I present numerical results showing how the much simpler Borda tally can be used to approximate the outcome of the Condorcet tally with high probability in certain circumstances, a proof that there exist classes of prob...

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...

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...

This paper examines the notion of ‘irrelevant’alternatives in the context of social choice problems. It is shown that seemingly irrelevant alternatives could be relevant because of their information content. This leads to a consideration of aggregation rules where an endogenous condition of independence of irrelevant alternatives is imposed. The analysis leads to the characterization of a uniqu...

In this paper the Borda rule is extended by allowing the voters to show their preferences among alternatives through linguistic labels. To this aim, we need to add them up for assigning a qualification to each alternative and then to compare such qualifications. Theoretically, all these assessments and comparisons fall into a totally ordered commutative monoid generated by the initial set of li...

In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomial-time approximation schemes) as well as obtain inapproximability results. In particular, we show that a large subclass of scoring protocols admits fully polynomial-time approximation schemes for the coalitional weight...

[Slinko and White, 2008] have recently introduced a new model of coalitional manipulation of voting rules under limited communication, which they call safe strategic voting. The computational aspects of this model were first studied by [Hazon and Elkind, 2010], who provide polynomial-time algorithms for finding a safe strategic vote under kapproval and the Bucklin rule. In this paper, we answer...

We provide exact relations giving the probability of individual and coalitional manipulation of three specific social choice functions (Borda rule, Copeland rule, Plurality rule) in three-alternative elections when the notion of self-selectivity is imposed. The results suggest that the Borda rule is more vulnerable to coalitional manipulation than the Copeland rule and the Plurality rule. Howev...