Some results on approximating the minimax solution in approval voting
Presented at the International Conference on Autonomous Agents and Multi-Agent Systems, Honolulu, Hawaii
Voting has been a very popular method for preference aggregation in multiagent environments. It is often the case that a set of agents with different preferences need to make a choice among a set of alternatives, where the alternatives could be various entities such as potential committee members, or joint plans of action. A standard methodology for this scenario is to have each agent express his preferences and then select an alternative according to some voting protocol. Several decision making applications in AI have followed this approach including problems in collaborative filtering  and planning [3, 4].
|E.H. Durfee , M. Yokoo , M.N. Huhns (Michael)|
|Algorithmic Optimization Discretization|
|International Conference on Autonomous Agents and Multi-Agent Systems|
|Organisation||Networks and Optimization|
Markakis, V, Mehta, A, & LeGrand, R. (2007). Some results on approximating the minimax solution in approval voting. In E.H Durfee, M Yokoo, & M.N Huhns (Eds.), Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems (pp. 1193–1195). ACM.