. -- Fixed and Random Matching ; Incomplete Information ; Ex-Post Regret Learning ; Nash Equilibrium ; Ex-Post Equilibrium …In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to … within a fixed set (fixed matching) or they are randomly matched to play the game (random matching). The relevant long run …

several well-known learning processes in the minority game with an arbitrary odd number of players. Interestingly, different … learning processes provide considerably different predictions …

This paper studies adaptive learning in the class of weighted network games. This class of games includes applications … show that quite general learning processes converge to a Nash equilibrium of a weighted network game if every player …

normal form game for ten rounds with random matching which is either a game solvable through iterated elimination of …

normal form game for ten rounds with random matching which is either a game solvable through iterated elimination of … are also able to learn structural properties of the games. -- Game Theory ; Learning ; Extrapolation …

is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized … fictitious play learning scheme, then for sufficiently large time, the players' bids are in equilibrium in the one-shot auction …

The novelty of our model is to combine models of collective action on networks with models of social learning. Agents …

are rare. Thus, even in a world of simple learning agents, coordination behavior can take on some surprising forms. …

study experimentally to what extent cross-game learning can reduce overbidding in SPAs, taking into account cognitive skills … losses from high bids are more salient than in SPAs. Experience in FPAs causes substantial cross-game learning for … bid shading by cognitively more able participants, resulting in lower profits in FPAs. Thus, cross-game learning has the …