We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

We extend Nash's bargaining theory to non-convex and coalitional problems. This paper investigates the implications of Nash-like axioms for bilateral problems and the properties of consistency and converse consistency over multilateral settings. The result is a characterization of the Nash set...

Consider an exchange economy with a finite number of agents, who are arbitragers, in that they try to upset allocations imagining plausible beneficial trades. Their thought process is interactive, in that agents are conscious that the others are also going through the same steps. With this...