Finding optimal solutions for voting game design problems

DOI10.1613/JAIR.4109MaRDI QIDQ5419478zbMATH OpenOpenAlexFDO

Authors Bart de Keijzer, Tomas B. Klos, Yingqian Zhang

Publication date 10 June 2014

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4109

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Voting theory (91B12)

Recommendations

• On the inverse power index problem
• Heuristic and exact solutions to the inverse power index problem for small voting bodies
• Computing power indices in weighted multiple majority games.

Cited in

(6)

• On the characterization of weighted simple games
• A parameterization for a class of complete games with abstention
• The inverse problem for power distributions in committees
• On the inverse power index problem
• Evaluating strategic structures in multi-agent inverse reinforcement learning
• ILP and CP models for normalized integer weighted voting game design problem

This page was built for publication: Finding optimal solutions for voting game design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419478)