The smart market is a global market where different sellers and buyers dynamically negociate price and quantity. Thoses negociations find net exchange, and after optimmization, optimal bilateral exchange. This paper present a round up of auctions mechanisms and the architecture of a generic...

In a repeated-interaction public goods economy, dynamic behavior may affect the efficiency of various mechanisms thought to be efficient in one-shot games. Inspired by results obtained in previous experiments, the current paper proposes a simple best response model in which players' beliefs are...

We empirically model performance in the final round of a multiple-round tournament as a spatially autoregressive process, allowing us to sign and quantify the endogenous interactions between competitors. Doing so speaks to significant regularities in the data that suggest that a player’s own...

A population of buyers and a population of sellers meet repeatedly in order to exchange a good. The price is fixed through a variant of the Nash demand game. This paper analyzes the prices that are robust to experimentation in the sense of stochastic stability. Under some conditions only one...

Equilibrium selection in the Nash demand game is investigated in a learning context with persistent randomness. I adopt a matching framework similar to Kandori, Mailath and Rob (1993) and assume that individuals belong to populations of different sizes. Despite the myopic behavior of...

Subjects played strategically similar 4x4 and 6x6 constant sum games under varying payoff scales. Substantial divergences from equilibrium predictions were exhibited. The dynamic pattern of play is best expalined by a stimulus learning model whereby players allocate weight to different actions...

We perform a further experiment to check the robustness of the main result in Rey Biel (2005) to sequential play. We find that Equilibrium predictions work even better when the same games are played sequentially: 85% of first movers choose the Equilibrium strategy and 85% of second movers best...

We consider a finite population of agents who exchange information and are paired every period to play a game with tension between risk dominance and Pareto efficiency. Agents sample past plays and corresponding payoffs from their information neighborhood, and choose one of two possible actions...

An iterative algorithm for establishing the Nash Equilibrium in pure strategies (NE) is proposed and tested in Cournot Game models. The algorithm is based on the convergence of sequential best responses and the utilization of a genetic algorithm for determining each player's best response to a...