Strategic issues in college admissions with score-limits

Naoyuki Kamiyama

doi:10.1016/j.orl.2017.01.001

Strategic issues in college admissions with score-limits

Naoyuki Kamiyama

数学テクノロジー先端研究部門

研究成果: ジャーナルへの寄稿 › 学術誌 › 査読

1 被引用数 (Scopus)

抄録

We consider strategic problems in college admissions with score-limits introduced by Biró and Kiselgof. We first consider the problem of deciding whether a given applicant can cheat the algorithm of Biró and Kiselgof so that this applicant is assigned to a more preferable college. We prove its polynomial-time solvability. In addition, we consider the situation in which all applicants strategically behave. We prove that a Nash equilibrium always exists, and we can find one in polynomial time.

本文言語	英語
ページ（範囲）	105-108
ページ数	4
ジャーナル	Operations Research Letters
巻	45
号	2
DOI	https://doi.org/10.1016/j.orl.2017.01.001
出版ステータス	出版済み - 3月 1 2017

!!!All Science Journal Classification (ASJC) codes

ソフトウェア
経営科学およびオペレーションズリサーチ
産業および生産工学
応用数学

文献へのアクセス

10.1016/j.orl.2017.01.001

他のファイルとリンク

引用スタイル

@article{be23878a41ca4478a14ce297128aaddc,

title = "Strategic issues in college admissions with score-limits",

abstract = "We consider strategic problems in college admissions with score-limits introduced by Bir{\'o} and Kiselgof. We first consider the problem of deciding whether a given applicant can cheat the algorithm of Bir{\'o} and Kiselgof so that this applicant is assigned to a more preferable college. We prove its polynomial-time solvability. In addition, we consider the situation in which all applicants strategically behave. We prove that a Nash equilibrium always exists, and we can find one in polynomial time.",

author = "Naoyuki Kamiyama",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = mar,

day = "1",

doi = "10.1016/j.orl.2017.01.001",

language = "English",

volume = "45",

pages = "105--108",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Strategic issues in college admissions with score-limits

AU - Kamiyama, Naoyuki

PY - 2017/3/1

Y1 - 2017/3/1

N2 - We consider strategic problems in college admissions with score-limits introduced by Biró and Kiselgof. We first consider the problem of deciding whether a given applicant can cheat the algorithm of Biró and Kiselgof so that this applicant is assigned to a more preferable college. We prove its polynomial-time solvability. In addition, we consider the situation in which all applicants strategically behave. We prove that a Nash equilibrium always exists, and we can find one in polynomial time.

AB - We consider strategic problems in college admissions with score-limits introduced by Biró and Kiselgof. We first consider the problem of deciding whether a given applicant can cheat the algorithm of Biró and Kiselgof so that this applicant is assigned to a more preferable college. We prove its polynomial-time solvability. In addition, we consider the situation in which all applicants strategically behave. We prove that a Nash equilibrium always exists, and we can find one in polynomial time.

UR - https://www.scopus.com/pages/publications/85009957921

UR - https://www.scopus.com/pages/publications/85009957921#tab=citedBy

U2 - 10.1016/j.orl.2017.01.001

DO - 10.1016/j.orl.2017.01.001

M3 - Article

AN - SCOPUS:85009957921

SN - 0167-6377

VL - 45

SP - 105

EP - 108

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

Strategic issues in college admissions with score-limits

抄録

!!!All Science Journal Classification (ASJC) codes

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル