通过逆向归纳法实现最佳奖学金分配

IF 0.5 4区 经济学 Q4 ECONOMICS Mathematical Social Sciences Pub Date : 2023-09-01 DOI:10.1016/j.mathsocsci.2023.06.001
Pablo Amorós
{"title":"通过逆向归纳法实现最佳奖学金分配","authors":"Pablo Amorós","doi":"10.1016/j.mathsocsci.2023.06.001","DOIUrl":null,"url":null,"abstract":"<div><p>A group of students who have applied for scholarships must be ranked. The committee responsible for determining this ranking consists of the students’ advisors. While impartial towards other students, the advisors are biased towards favoring their students. This paper examines the implementation of the deserving ranking via backward induction. Some of the best-known sequential mechanisms utilized in the real world are ineffective. We present two simple and natural sequential mechanisms that prove to be effective. The first mechanism is suitable for when there are precisely three students, and the second is for four or more students.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"125 ","pages":"Pages 1-10"},"PeriodicalIF":0.5000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementing optimal scholarship assignments via backward induction\",\"authors\":\"Pablo Amorós\",\"doi\":\"10.1016/j.mathsocsci.2023.06.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A group of students who have applied for scholarships must be ranked. The committee responsible for determining this ranking consists of the students’ advisors. While impartial towards other students, the advisors are biased towards favoring their students. This paper examines the implementation of the deserving ranking via backward induction. Some of the best-known sequential mechanisms utilized in the real world are ineffective. We present two simple and natural sequential mechanisms that prove to be effective. The first mechanism is suitable for when there are precisely three students, and the second is for four or more students.</p></div>\",\"PeriodicalId\":51118,\"journal\":{\"name\":\"Mathematical Social Sciences\",\"volume\":\"125 \",\"pages\":\"Pages 1-10\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Social Sciences\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0165489623000550\",\"RegionNum\":4,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Social Sciences","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0165489623000550","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

必须对申请奖学金的一群学生进行排名。负责确定这一排名的委员会由学生顾问组成。尽管顾问们对其他学生不偏不倚,但他们偏向于偏袒自己的学生。本文通过后向归纳法考察了实得排名的实施。现实世界中使用的一些最著名的顺序机制是无效的。我们提出了两个简单自然的顺序机制,证明是有效的。第一种机制适用于恰好有三名学生的情况,第二种机制适用于四名或四名以上的学生。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Implementing optimal scholarship assignments via backward induction

A group of students who have applied for scholarships must be ranked. The committee responsible for determining this ranking consists of the students’ advisors. While impartial towards other students, the advisors are biased towards favoring their students. This paper examines the implementation of the deserving ranking via backward induction. Some of the best-known sequential mechanisms utilized in the real world are ineffective. We present two simple and natural sequential mechanisms that prove to be effective. The first mechanism is suitable for when there are precisely three students, and the second is for four or more students.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Social Sciences
Mathematical Social Sciences 数学-数学跨学科应用
CiteScore
1.30
自引率
0.00%
发文量
55
审稿时长
59 days
期刊介绍: The international, interdisciplinary journal Mathematical Social Sciences publishes original research articles, survey papers, short notes and book reviews. The journal emphasizes the unity of mathematical modelling in economics, psychology, political sciences, sociology and other social sciences. Topics of particular interest include the fundamental aspects of choice, information, and preferences (decision science) and of interaction (game theory and economic theory), the measurement of utility, welfare and inequality, the formal theories of justice and implementation, voting rules, cooperative games, fair division, cost allocation, bargaining, matching, social networks, and evolutionary and other dynamics models. Papers published by the journal are mathematically rigorous but no bounds, from above or from below, limits their technical level. All mathematical techniques may be used. The articles should be self-contained and readable by social scientists trained in mathematics.
期刊最新文献
Stability and optimal double auction design for a two-sided market Consistent conjectures in dynamic matching markets Inequality and bipolarization-reducing mixed taxation Project selection with partially verifiable information On the decomposability of fractional allocations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1