Matching games with partial information
统计力学
2009-11-10 v1 适应与自组织系统
物理与社会
摘要
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.
引用
@article{arxiv.cond-mat/0305101,
title = {Matching games with partial information},
author = {Paolo Laureti and Yi-Cheng Zhang},
journal= {arXiv preprint arXiv:cond-mat/0305101},
year = {2009}
}
备注
19 pages, 8 figs