Strategy-Proofness of Worker-Optimal Matching with Continuously Transferable Utility

Ravi  Jagadeesan; Scott Duke Kominers; Ross  Rheingans-Yoo

}
//]]>
</script>
<input type="hidden" name="__VIEWSTATEGENERATOR" id="__VIEWSTATEGENERATOR" value="E39AC016" />
<script type="text/javascript">RegisterSod("sp.core.js", "\u002f_layouts\u002fsp.core.js?rev=7ByNlH\u00252BvcgRJg\u00252BRCctdC0w\u00253D\u00253D");</script><script type="text/javascript">RegisterSod("sp.res.resx", "\u002f_layouts\u002fScriptResx.ashx?culture=en\u00252Dus\u0026name=SP\u00252ERes\u0026rev=b6\u00252FcRx1a6orhAQ\u00252FcF\u00252B0ytQ\u00253D\u00253D");</script><script type="text/javascript">RegisterSod("sp.ui.dialog.js", "\u002f_layouts\u002fsp.ui.dialog.js?rev=Tpcmo1\u00252FSu6R0yewHowDl5g\u00253D\u00253D");RegisterSodDep("sp.ui.dialog.js", "sp.core.js");RegisterSodDep("sp.ui.dialog.js", "sp.res.resx");</script><script type="text/javascript">RegisterSod("core.js", "\u002f_layouts\u002f1033\u002fcore.js?rev=Emb5hNX1RZMNXk9oS82yvA\u00253D\u00253D");</script>
<script type="text/javascript">
//<![CDATA[
var _spFormDigestRefreshInterval = 1440000;window.g_updateFormDigestPageLoaded = new Date(); window.g_updateFormDigestPageLoaded.setDate(window.g_updateFormDigestPageLoaded.getDate() -5);function loadMDN2() { EnsureScript('MDN.js', typeof(loadFilterFn), null); }
function loadMDN1() { ExecuteOrDelayUntilScriptLoaded(loadMDN2, 'sp.ribbon.js'); }
_spBodyOnLoadFunctionNames.push('loadMDN1');//]]>
</script>
<script type="text/javascript">RegisterSod("sp.runtime.js", "\u002f_layouts\u002fsp.runtime.js?rev=IGffcZfunndj0247nOxKVg\u00253D\u00253D");RegisterSodDep("sp.runtime.js", "sp.core.js");RegisterSodDep("sp.runtime.js", "sp.res.resx");</script><script type="text/javascript">RegisterSod("sp.js", "\u002f_layouts\u002fsp.js?rev=\u00252B4ZEyA892P3T0504qi0paw\u00253D\u00253D");RegisterSodDep("sp.js", "sp.core.js");RegisterSodDep("sp.js", "sp.runtime.js");RegisterSodDep("sp.js", "sp.ui.dialog.js");RegisterSodDep("sp.js", "sp.res.resx");</script><script type="text/javascript">RegisterSod("cui.js", "\u002f_layouts\u002fcui.js?rev=OOyJv78CADNBeet\u00252FvTvniQ\u00253D\u00253D");</script><script type="text/javascript">RegisterSod("inplview", "\u002f_layouts\u002finplview.js?rev=WB6Gy8a027aeNCq7koVCUg\u00253D\u00253D");RegisterSodDep("inplview", "core.js");RegisterSodDep("inplview", "sp.js");</script><script type="text/javascript">RegisterSod("ribbon", "\u002f_layouts\u002fsp.ribbon.js?rev=F\u00252BUEJ66rbXzSvpf7nN69wQ\u00253D\u00253D");RegisterSodDep("ribbon", "core.js");RegisterSodDep("ribbon", "sp.core.js");RegisterSodDep("ribbon", "sp.js");RegisterSodDep("ribbon", "cui.js");RegisterSodDep("ribbon", "sp.res.resx");RegisterSodDep("ribbon", "sp.runtime.js");RegisterSodDep("ribbon", "inplview");</script><script type="text/javascript">RegisterSod("sp.ui.policy.resources.resx", "\u002f_layouts\u002fScriptResx.ashx?culture=en\u00252Dus\u0026name=SP\u00252EUI\u00252EPolicy\u00252EResources\u0026rev=YhBHGmUAGyJ3lAgSdE4V\u00252Fw\u00253D\u00253D");</script><script type="text/javascript">RegisterSod("mdn.js", "\u002f_layouts\u002fmdn.js?rev=gwmFFJ2\u00252FfFacqXWAqG\u00252FqKg\u00253D\u00253D");RegisterSodDep("mdn.js", "sp.core.js");RegisterSodDep("mdn.js", "sp.runtime.js");RegisterSodDep("mdn.js", "sp.js");RegisterSodDep("mdn.js", "cui.js");RegisterSodDep("mdn.js", "ribbon");RegisterSodDep("mdn.js", "sp.ui.policy.resources.resx");</script>
<script type="text/javascript">
//<![CDATA[

function _spNavigateHierarchyEx(nodeDiv, dataSourceId, dataPath, url, listInContext, type, additionalQString) {
    SetAdditionalNavigateHierarchyQString(additionalQString);
    g_originalSPNavigateFunc(nodeDiv, dataSourceId, dataPath, url, listInContext, type);
}

g_originalSPNavigateFunc = _spNavigateHierarchy;
_spNavigateHierarchy = _spNavigateHierarchyEx;
var _fV4UI = true;//]]>
</script>
<script type="text/javascript">RegisterSod("msstring.js", "\u002f_layouts\u002f1033\u002fmsstring.js?rev=QtiIcPH3HV7LgVSO7vONFg\u00253D\u00253D");</script><script type="text/javascript">RegisterSod("browserScript", "\u002f_layouts\u002f1033\u002fnon_ie.js?rev=EVTj1bu32\u00252FMla6SDN\u00252FsNTA\u00253D\u00253D");</script>
<script type="text/javascript">
//<![CDATA[
var __wpmExportWarning='This Web Part Page has been personalized. As a result, one or more Web Part properties may contain confidential information. Make sure the properties contain information that is safe for others to read. After exporting this Web Part, view properties in the Web Part description file (.WebPart) by using a text editor such as Microsoft Notepad.';var __wpmCloseProviderWarning='You are about to close this Web Part.  It is currently providing data to other Web Parts, and these connections will be deleted if this Web Part is closed.  To close this Web Part, click OK.  To keep this Web Part, click Cancel.';var __wpmDeleteWarning='You are about to permanently delete this Web Part.  Are you sure you want to do this?  To delete this Web Part, click OK.  To keep this Web Part, click Cancel.';//]]>
</script>
</form>

Go to main content

Article | Games and Economic Behavior

Strategy-Proofness of Worker-Optimal Matching with Continuously Transferable Utility

by Ravi Jagadeesan, Scott Duke Kominers and Ross Rheingans-Yoo

Abstract

We give a direct proof of one-sided strategy-proofness for worker-firm matching under continuously transferable utility. A new “Lone Wolf” theorem (Jagadeesan et al., 2017) for settings with transferable utility allows us to adapt the method of proving one-sided strategy-proofness that is typically used in settings with discrete transfers.

Keywords: matching; Strategy-proofness; Lone Wolf Theorem; Rural Hospitals Theorem; Mechanism design; Marketplace Matching;

Format: Print

Read Now

Citation:

Jagadeesan, Ravi, Scott Duke Kominers, and Ross Rheingans-Yoo. "Strategy-Proofness of Worker-Optimal Matching with Continuously Transferable Utility." Games and Economic Behavior 108 (March 2018): 287–294.

About the Author

Scott Duke Kominers

MBA Class of 1960 Associate Professor of Business Administration

Entrepreneurial Management

View Profile »
View Publications »

More from the Author

Article | Bloomberg Opinion

How to End the Plasma Shortage for Coronavirus Patients

Scott Duke Kominers

Those who have recovered from the virus will donate more blood if given the right incentives.

Citation:
Kominers, Scott Duke. "How to End the Plasma Shortage for Coronavirus Patients." Bloomberg Opinion (May 11, 2020). View Details

Cite View Details Register to Read Related
Working Paper | HBS Working Paper Series | 2020

Paying It Backward and Forward: Expanding Access to Convalescent Plasma Therapy Through Market Design

Scott Duke Kominers, Parag A. Pathak, Tayfun Sönmez and M. Utku Ünver

COVID-19 convalescent plasma (CCP) therapy is currently a leading treatment for COVID-19. At present, there is a shortage of CCP relative to demand. We develop and analyze a model of centralized CCP allocation that incorporates both donation and distribution. In order to increase CCP supply, we introduce a mechanism that utilizes two incentive schemes, respectively based on principles of “paying it backward" and “paying it forward." Under the first scheme, CCP donors obtain treatment vouchers that can be transferred to patients of their choosing. Under the latter scheme, patients obtain priority for CCP therapy in exchange for a future pledge to donate CCP if possible. We show that in steady-state, both principles generally increase overall treatment rates for all patients—not just those who are voucher-prioritized or pledged to donate. Our results also hold under certain conditions if a fraction of CCP is reserved for patients who participate in clinical trials. Finally, we examine the implications of pooling blood types on the efficiency and equity of CCP distribution.

Citation:
Kominers, Scott Duke, Parag A. Pathak, Tayfun Sönmez, and M. Utku Ünver. "Paying It Backward and Forward: Expanding Access to Convalescent Plasma Therapy Through Market Design." Harvard Business School Working Paper, No. 20-116, May 2020. View Details

Cite View Details Read Now Related
Article | Journal de Théorie des Nombres de Bordeaux | 2019

Configurations of Extremal Type II Codes via Harmonic Weight Enumerators

Noam D. Elkies and Scott Duke Kominers

We prove configuration results for extremal Type II codes, analogous to the configuration results of Ozeki and of the second author for extremal Type II lattices. Specifically, we show that for n ∈{8,24,32,48,56,72,96} every extremal Type II code of length n is generated by its codewords of minimal weight. Where Ozeki and Kominers used spherical harmonics and weighted theta functions, we use discrete harmonic polynomials and harmonic weight enumerators. Along the way we introduce "t12-designs" as a discrete analog of Venkov's spherical designs of the same name.

Keywords: Mathematical Methods;

Citation:
Elkies, Noam D., and Scott Duke Kominers. "Configurations of Extremal Type II Codes via Harmonic Weight Enumerators." Journal de Théorie des Nombres de Bordeaux 31, no. 3 (2019): 679–688. View Details

Cite View Details Read Now Related

Faculty & Research

Strategy-Proofness of Worker-Optimal Matching with Continuously Transferable Utility

Abstract

Citation:

About the Author

More from the Author