Matching games with partial information

Paolo Laureti

Game Theory and Information from University Library of Munich, Germany

Abstract: We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded rationality in a generalized {\it Marriage Problem}, comparing the benefits obtained by self-searching and by a matchmaker. Finally we propose a modified matching game intended to mimic the way consumers' information makes firms to enhance the quality of their products in a competitive market.

Keywords: Asymmetric information; Marriage Problem; Bounded rationality (search for similar items in EconPapers)
JEL-codes: C61 C73 C78 (search for similar items in EconPapers)
Pages: 19 pages
Date: 2003-07-16
New Economics Papers: this item is included in nep-mic
Note: Type of Document - PostScript; prepared on linux; to print on PostScript; pages: 19; figures: included. Published on Physica A 324(1- 2) 49-65 (2003)
References: View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0307/0307002.pdf (application/pdf)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0307/0307002.ps.gz (application/postscript)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:0307002

Access Statistics for this paper

More papers in Game Theory and Information from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).