My bibliography  Save this paper

# Matching games with partial information

## Author

Listed:
• Paolo Laureti Yi-Cheng Zhang

## 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.

## Suggested Citation

• Paolo Laureti Yi-Cheng Zhang, 2003. "Matching games with partial information," Game Theory and Information 0307002, University Library of Munich, Germany.
• Handle: RePEc:wpa:wuwpga:0307002
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)
as

File URL: https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0307/0307002.pdf

File URL: https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0307/0307002.ps.gz

## Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as

Cited by:

1. Tilles, Paulo F.C. & Ferreira, Fernando F. & Francisco, Gerson & Pereira, Carlos de B. & Sarti, Flavia M., 2011. "A Markovian model market—Akerlof’s lemons and the asymmetry of information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(13), pages 2562-2570.

### Keywords

Asymmetric information; Marriage Problem; Bounded rationality;

### JEL classification:

• C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
• C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
• C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

### NEP fields

This paper has been announced in the following NEP Reports:

## Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0307002. 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: (EconWPA) or (Christopher F. Baum). General contact details of provider: https://econwpa.ub.uni-muenchen.de .

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.

We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.