Please use this identifier to cite or link to this item:
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/4655
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Barelli, Paulo | - |
dc.contributor.author | Bhattacharya, Sourav | - |
dc.contributor.author | Siga, Lucas | - |
dc.date.accessioned | 2024-01-28T15:49:30Z | - |
dc.date.available | 2024-01-28T15:49:30Z | - |
dc.date.issued | 2022-09 | - |
dc.identifier.issn | 1468-0262 (online) | - |
dc.identifier.uri | https://doi.org/10.3982/ECTA16376 | - |
dc.identifier.uri | https://ir.iimcal.ac.in:8443/jspui/handle/123456789/4655 | - |
dc.description | Biosketch: Paulo Barelli, Department of Economics, University of Rochester; Sourav Bhattacharya, Economics group, Indian Institute of Management Calcutta, Kolkata, India; Lucas Siga, Department of Economics, University of Essex . | en_US |
dc.description.abstract | We study the problem of aggregating private information in elections with two or more alternatives for a large family of scoring rules. We introduce a feasibility condition, the linear refinement condition, that characterizes when information can be aggregated asymptotically as the electorate grows large: there must exist a utility function, linear in distributions over signals, sharing the same top alternative as the primitive utility function. Our results complement the existing work where strong assumptions are imposed on the environment, and caution against potential false positives when too much structure is imposed. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Econometrica | en_US |
dc.relation.ispartofseries | Vol. 90;No. 5 | - |
dc.subject | Information aggregation | en_US |
dc.subject | Codorcet jury theorem | en_US |
dc.subject | Scoring rules | en_US |
dc.subject | Large elections | en_US |
dc.title | Full Information Equivalence in Large Elections | en_US |
dc.type | Article | en_US |
Appears in Collections: | Economics |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.