Meaningful learning in weighted voting games: an experiment

Theory and Decision 83 (1):131-153 (2017)
  Copy   BIBTEX

Abstract

By employing binary committee choice problems, this paper investigates how varying or eliminating feedback about payoffs affects: subjects’ learning about the underlying relationship between their nominal voting weights and their expected payoffs in weighted voting games; the transfer of acquired learning from one committee choice problem to a similar but different problem. In the experiment, subjects choose to join one of two committees and obtain a payoff stochastically determined by a voting theory. We found that: subjects learned to choose the committee that generates a higher expected payoff even without feedback about the payoffs they received; there was statistically significant evidence of “meaningful learning” only for the treatment with no payoff-related feedback. This finding calls for re-thinking existing models of learning to incorporate some type of introspection.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On anonymous and weighted voting systems.Josep Freixas & Montserrat Pons - 2021 - Theory and Decision 91 (4):477-491.
Strategic Voting Under Uncertainty About the Voting Method.Wesley H. Holliday & Eric Pacuit - 2019 - Electronic Proceedings in Theoretical Computer Science 297:252–272.

Analytics

Added to PP
2017-02-07

Downloads
3 (#1,213,485)

6 months
18 (#821,922)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references