Learnability of a class of Non-atomic Games arising on the Internet

Eric Friedman ()
Additional contact information
Eric Friedman: Rutgers University

Departmental Working Papers from Rutgers University, Department of Economics

Abstract: In this paper we study a large class of non-atomic games arising from interactions on the Internet, such as many users sharing a network link, researchers accessing a database or web server, subscribers to a network services provider trying to gain access to the modem pool and many more. We provide simple and easily computable conditions under which these games are learnable by several models of learning, such as adaptive and sophisticated learning (Milgrom and Roberts 1991), calibrated learning (Foster and Vohra 1996), and reasonable learning (Friedman and Shenker 1997). Thus, using these methods one can evaluate the stability of such games on the Internet or in other settings in which players must learn over time.

Keywords: learning (search for similar items in EconPapers)
JEL-codes: C72 (search for similar items in EconPapers)
Date: 1998-10-15
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sas.rutgers.edu/virtual/snde/wp/1998-24.pdf (application/pdf)

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:rut:rutres:199824

Access Statistics for this paper

More papers in Departmental Working Papers from Rutgers University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by ().