Abstract We are interested in how Groves-Ledyard mechanisms perform when used repeatedly in a sequence of one-shot games where agents know only their own preferences. In particular, how fast do the mechanisms converge to the stage game Nash equilibrium and how does that speed of convergence...