Advanced Search
MyIDEAS: Login to save this paper or follow this series

Profit-Maximizing Matchmaker

Contents:

Author Info

  • Hideo Konishi

    ()
    (Boston College)

  • Chiu Yu Ko

    (Boston College)

Abstract

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso-Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firms' reports following Milgrom (2010). We show that in the simple message space, (i) the matchmaker's profit is always zero and an acceptable assignment is achieved in every Nash equilibrium, and (ii) the sets of stable assignments and strong Nash equilibria are equivalent. By contrast, in the general message space, the matchmaker may make a positive profit even in a strong Nash equilibrium. This shows that restricting message space not only reduces the information requirement but also improves resource allocation.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://fmwww.bc.edu/EC-P/wp721.pdf
File Function: main text
Download Restriction: no

Bibliographic Info

Paper provided by Boston College Department of Economics in its series Boston College Working Papers in Economics with number 721.

as in new window
Length:
Date of creation: 28 Oct 2009
Date of revision: 23 Apr 2012
Publication status: published, Games and Economic Behavior
Handle: RePEc:boc:bocoec:721

Contact details of provider:
Postal: Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA
Phone: 617-552-3670
Fax: +1-617-552-2308
Email:
Web page: http://fmwww.bc.edu/EC/
More information through EDIRC

Related research

Keywords: two-sided matching problem; stable assignment; strong Nash equilibrium; coalition-proof Nash equilibrium; no-rent property; implementation theory;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Bernheim, B Douglas & Whinston, Michael D, 1986. "Menu Auctions, Resource Allocation, and Economic Influence," The Quarterly Journal of Economics, MIT Press, vol. 101(1), pages 1-31, February.
  2. Laussel, Didier & Le Breton, Michel, 2001. "Conflict and Cooperation: The Structure of Equilibrium Payoffs in Common Agency," Journal of Economic Theory, Elsevier, vol. 100(1), pages 93-128, September.
  3. Roth, Alvin E. & Sotomayor, Marilda, 1992. "Two-sided matching," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541 Elsevier.
  4. Sonmez, Tayfun, 1997. "Games of Manipulation in Marriage Problems," Games and Economic Behavior, Elsevier, vol. 20(2), pages 169-176, August.
  5. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521551847, April.
  6. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
  7. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
  8. Alcalde, Jose & Perez-Castrillo, David & Romero-Medina, Antonio, 1998. "Hiring Procedures to Implement Stable Allocations," Journal of Economic Theory, Elsevier, vol. 82(2), pages 469-480, October.
  9. Milgrom, Paul, 2010. "Simplified mechanisms with an application to sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 70(1), pages 62-70, September.
  10. Takashi Hayashi & Toyotaka Sakai, 2009. "Nash implementation of competitive equilibria in the job-matching market," International Journal of Game Theory, Springer, vol. 38(4), pages 453-467, November.
  11. Shin, Sungwhee & Suh, Sang-Chul, 1996. "A mechanism implementing the stable rule in marriage problems," Economics Letters, Elsevier, vol. 51(2), pages 185-189, May.
  12. Konishi, Hideo & Le Breton, Michel & Weber, Shlomo, 1999. "On Coalition-Proof Nash Equilibria in Common Agency Games," Journal of Economic Theory, Elsevier, vol. 85(1), pages 122-139, March.
  13. Bernheim, B. Douglas & Peleg, Bezalel & Whinston, Michael D., 1987. "Coalition-Proof Nash Equilibria I. Concepts," Journal of Economic Theory, Elsevier, vol. 42(1), pages 1-12, June.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:boc:bocoec:721. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.