Yeon-Koo Che
Biographic Data
| ID | 5867910 |
|---|---|
| NAME | Yeon-Koo Che |
| GIVEN NAMES | Yeon-Koo |
| FAMILY NAME | Che |
| SIGNATURE | CHE Y |
| AFFILIATIONS | Department of Economics; Columbia University |
| VERIFIED | No |
| TOTAL WORKS | 7 |
| TOTAL CITATIONS | 15 |
| AUTHOR COUNT | 7 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1997 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 1 |
Keeping the Listener Engaged: A Dynamic Model of Bayesian Persuasion
We consider a dynamic model of Bayesian persuasion in which information takes time and is costly for the sender to generate and for the receiver to process, and neither player can commit to their future actions. Persuasion may totally collapse in a Markov perfect equilibrium of this game. However, for persuasion costs sufficiently small, a version of a folk theorem holds: outcomes that approximate Kamenica and Gentzkow's sender-optimal persuasion…
Payoff equivalence of efficient mechanisms in large matching markets: Payoff equivalence in matching markets
We study Pareto efficient mechanisms in matching markets when the number of agents is large and individual preferences are randomly drawn from a class of distributions, allowing for both common and idiosyncratic shocks. We provide a broad set of circumstances under which, as the market grows large, all Pareto efficient mechanisms—including top trading cycles (with an arbitrary ownership structure), serial dictatorship (with an arbitrary serial or…
Efficiency and Stability in Large Matching Markets
We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals’ preferences and priorities are drawn randomly. When agents’ preferences are uncorrelated, then both efficiency and stability can be achieved in an asymptotic sense via standard mechanisms such as deferred acceptance and top trading cycles. When agents’ preferences are correlated over objects, however, these mechanisms are either ineffi…
Minimizing Justified Envy in School Choice: The Design of New Orleans' OneApp
In 2012, New Orleans Recovery School District (RSD) became the first U.S. district to unify charter and traditional public school admissions in a single-offer assignment mechanism known as OneApp. The RSD also became the first district to use a mechanism based on Top Trading Cycles (TTC) in a real-life allocation problem. Since TTC was originally devised for settings in which agents have endowments, there is no formal rationale for TTC in school …
Exploiting Plaintiffs through Settlement: Divide and Conquer
This paper considers settlement negotiations between a single defendant and N plaintiffs when there are fixed costs of litigation. When making simultaneous take-it-or-leave-it offers to the plaintiffs, the defendant adopts a divide-and-conquer strategy. Plaintiffs settle their claims for less than they are jointly worth. The problem is worse when N is larger, the offers are sequential, and the plaintiffs make offers instead. Although divide-and-c…
Products Liability, Signaling and Disclosure
»Vielmehr bietet [der Kommentar] auf höchstem Niveau eine substantielle Auseinandersetzung mit den Hintergründen, den Zusammenhängen, der Theorie und der Praxis des Grundgesetzes. Besseres lässt sich von einem Verfassungskommentar nicht sagen.“ Herbert Günther Staaatsanzeiger für das Land Hessen 2018 (50), 1494–1495
Rent dissipation when rent seekers are budget constrained
Rent dissipation when rent seekers are budget constrained
Keeping the Listener Engaged: A Dynamic Model of Bayesian Persuasion
We consider a dynamic model of Bayesian persuasion in which information takes time and is costly for the sender to generate and for the receiver to process, and neither player can commit to their future actions. Persuasion may totally collapse in a Markov perfect equilibrium of this game. However, for persuasion costs sufficiently small, a version of a folk theorem holds: outcomes that approximate Kamenica and Gentzkow's sender-optimal persuasion…
Efficiency and Stability in Large Matching Markets
We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals’ preferences and priorities are drawn randomly. When agents’ preferences are uncorrelated, then both efficiency and stability can be achieved in an asymptotic sense via standard mechanisms such as deferred acceptance and top trading cycles. When agents’ preferences are correlated over objects, however, these mechanisms are either ineffi…
Rent dissipation when rent seekers are budget constrained
Exploiting Plaintiffs through Settlement: Divide and Conquer
This paper considers settlement negotiations between a single defendant and N plaintiffs when there are fixed costs of litigation. When making simultaneous take-it-or-leave-it offers to the plaintiffs, the defendant adopts a divide-and-conquer strategy. Plaintiffs settle their claims for less than they are jointly worth. The problem is worse when N is larger, the offers are sequential, and the plaintiffs make offers instead. Although divide-and-c…
Products Liability, Signaling and Disclosure
»Vielmehr bietet [der Kommentar] auf höchstem Niveau eine substantielle Auseinandersetzung mit den Hintergründen, den Zusammenhängen, der Theorie und der Praxis des Grundgesetzes. Besseres lässt sich von einem Verfassungskommentar nicht sagen.“ Herbert Günther Staaatsanzeiger für das Land Hessen 2018 (50), 1494–1495
Minimizing Justified Envy in School Choice: The Design of New Orleans' OneApp
In 2012, New Orleans Recovery School District (RSD) became the first U.S. district to unify charter and traditional public school admissions in a single-offer assignment mechanism known as OneApp. The RSD also became the first district to use a mechanism based on Top Trading Cycles (TTC) in a real-life allocation problem. Since TTC was originally devised for settings in which agents have endowments, there is no formal rationale for TTC in school …
Payoff equivalence of efficient mechanisms in large matching markets: Payoff equivalence in matching markets
We study Pareto efficient mechanisms in matching markets when the number of agents is large and individual preferences are randomly drawn from a class of distributions, allowing for both common and idiosyncratic shocks. We provide a broad set of circumstances under which, as the market grows large, all Pareto efficient mechanisms—including top trading cycles (with an arbitrary ownership structure), serial dictatorship (with an arbitrary serial or…
Efficiency and Stability in Large Matching Markets
We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals’ preferences and priorities are drawn randomly. When agents’ preferences are uncorrelated, then both efficiency and stability can be achieved in an asymptotic sense via standard mechanisms such as deferred acceptance and top trading cycles. When agents’ preferences are correlated over objects, however, these mechanisms are either ineffi…
Keeping the Listener Engaged: A Dynamic Model of Bayesian Persuasion
We consider a dynamic model of Bayesian persuasion in which information takes time and is costly for the sender to generate and for the receiver to process, and neither player can commit to their future actions. Persuasion may totally collapse in a Markov perfect equilibrium of this game. However, for persuasion costs sufficiently small, a version of a folk theorem holds: outcomes that approximate Kamenica and Gentzkow's sender-optimal persuasion…
Computer Science (5 works) · Economics (4 works) · Mathematics (4 works) · Microeconomics (4 works) · Statistics (4 works) · Auction Theory and Applications (3 works) · Game Theory and Voting Systems (3 works) · Law (3 works) · Mathematical economics (3 works) · Political science (3 works)