Applying Integer Programming Techniques to Find Minimum Integer Weights of Voting Games

摘要: Using concepts from computer science and mathematics I develop three algorithms to find the minimum integer weights for voting games. Games with up at least 17 players can be solved in a reasonable amount of time. First, coalitions are mapped constraints, reducing problem constraint optimization. The optimization techniques used Gomory’s all-integer simplex algorithm variant popular programming method branch bound. Theoretical results include that not unique confirmation prior result proportional priori seat share. Thus, these useful researchers evaluating differences between bargaining models formateur models. running times different contrasted analyzed potential improvements. Thesis Supervisor: Stephen Ansolabehere Title: Professor, Department Political Science