Abstract
Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable if the cardinality of this set always remains the same when replacing the initial permutation with its inverse. It is called nudgable otherwise. We show that all full permutation groups, standard dihedral groups, half of the alternating groups, and any abelian subgroup are non-nudgable. In the right probabilistic sense, it is thus quite likely that a randomly generated subgroup is non-nudgable. However, the other half of the alternating groups are nudgable. We also construct a smallest possible nudgable group, a 6-element subgroup of the permutation group on 4 elements.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J.D. Dixon, The probability of generating the symmetric group, Math. Z. 110 (1969), 199–205.
J. D. Dixon and B. Mortimer, Permutation Groups, Graduate Texts in Mathematics, 163, Springer-Verlag, New York, 1996
N. Netzer and J.-M. Benkert, Informational requirements of nudging, preprint.
J. J. Rotman, A First Course in Abstract Algebra, Prentice Hall, Inc., Upper Saddle River, NJ, 1996.
A. Rubinstein and Y. Salant, Eliciting welfare preferences from behavioural data sets, Review of Economic Studies 79 (2012), 375–387.
R. Thaler and C. Sunstein, Nudge: Improving Decisions About Health, Wealth and Happiness, Yale University Press, New Haven, CT, 2008.
Author information
Authors and Affiliations
Corresponding author
Additional information
The author thanks Nick Netzer for bringing up the main question of this article, and both Steffen Kionke and Nick Netzer for inspiring discussions on the topic.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Netzer, T. Non-nudgable subgroups of permutations. Arch. Math. 109, 401–406 (2017). https://doi.org/10.1007/s00013-017-1086-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-017-1086-4