Solving Hard Control Problems in Voting Systems via Integer Programming

Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control problems. Our ILP formulations are flexible in the sense that they can work with an arbitrary number of candidates and voters. Using the off-the-shelf solver Cplex, we show that our approaches can manipulate elections with a large number of voters and candidates efficiently

An efficient protocol for the problem of secure two-party vector dominance

The problem of secure two-party vector dominance requires the comparison of two vectors in an "all-or-nothing" way. In this paper we provide a solution to this problem based on the semi-honest model. It is reduced to the problem of privacy preserving prefix test, and an additive threshold homomorphic encryption is used to protect those privacies while computing the results of all of the prefix tests. Our solution has advantages of efficiency and security in comparison with other solutions.Yingpeng Sang, Hong Shen, Zonghua Zhan

Some Efficient Solutions to Yao's Millionaire Problem

We present three simple and efficient protocol constructions to solve Yao's Millionaire Problem when the parties involved are non-colluding and semi-honest. The first construction uses a partially homomorphic Encryption Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit evaluations (subtraction and XOR) and a single decryption. The second construction uses an untrusted third party and achieves a communication overhead linear in input bit-size with the help of an order preserving function.Moreover, the second construction does not require an apriori input bound and can work on inputs of different bit-sizes. The third construction does not use a third party and, even though, it has a quadratic communication overhead, it is a fairly simple construction.Comment: 17 page

Stochastic Dominance Portfolio Analysis of Forestry Assets

We consider the forestry decision-making and harvesting problem from the perspective of financial portfolio management, where harvestable forest stands constitute one of the liquid assets of the portfolio. Using real data from Finnish mixed borealis forests and from the Helsinki stock exchange, we investigate the effect of trading the timber stock together with the forest land, or without the land (i.e., harvesting), on the portfolio efficiency. As our research methodology, we utilize the general Stochastic Dominance (SD) criteria, focusing on the recent theoretical advances in analyzing portfolio diversification within the SD framework. Our findings shed some further light on the question of how to model the forestry planning problem, and provide some comparative evidence of the applicability of the alternative SD test approaches.Forest Management, Portfolio Optimization, Stochastic Dominance, Diversification