The golden number and Fibonacci sequences in the design of voting structures

DOI10.1016/j.ejor.2012.10.017zbMath1292.91018arXiv1401.8180OpenAlexW1974701307MaRDI QIDQ2253562

Josep Freixas, Sascha Kurz

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.8180

zbMATH Keywords

game theoryvoting systemscomplete simple gamesenumeration and classificationoperational research structures

Mathematics Subject Classification ID

Cooperative games (91A12) Voting theory (91B12) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

Enumeration of simple games with two equivalence classes of players ⋮ On the characterization of weighted simple games ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ Proper strong-Fibonacci games ⋮ A parameterization for a class of complete games with abstention ⋮ On the enumeration of bipartite simple games ⋮ On the enumeration of Boolean functions with distinguished variables

This page was built for publication: The golden number and Fibonacci sequences in the design of voting structures