Friend-based ranking (Record no. 521205)

000 -LEADER
fixed length control field 00964nam a22001457a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221226b ||||| |||| 00| 0 eng d
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Bloch, Francis and Olckers, Matthew
245 ## - TITLE STATEMENT
Title Friend-based ranking
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc American Economic Journal: Microeconomics
300 ## - PHYSICAL DESCRIPTION
Extent 14(2), May, 2022: p.176-214
520 ## - SUMMARY, ETC.
Summary, etc We analyze the design of a mechanism to extract a ranking of individuals according to a unidimensional characteristic, such as ability or need. Individuals, connected on a social network, only have local information about the ranking. We show that a planner can construct an ex post incentive compatible and efficient mechanism if and only if every pair of friends has a friend in common. We characterize the windmill network as the sparsest social network for which the planner can always construct a complete ranking. – Reproduced
773 ## - HOST ITEM ENTRY
Main entry heading American Economic Journal: Microeconomics
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN)
Subject DIP RANKING
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Item type Articles
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Serial Enumeration / chronology Barcode Date last seen Koha item type
          Indian Institute of Public Administration Indian Institute of Public Administration 2022-12-26 14(2), May, 2022: p.176-214 AR127753 2022-12-26 Articles

Powered by Koha