Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...

We consider a clearing problem in peer-to-peer energy markets, where prosumers can trade energy among each other and with the main grid to meet their energy demands. By using a game- theoretic formulation and exploiting operator-theoretic methods for generalized Nash equilibrium seeking, we...

I study the path properties of adaptive heuristics that mimic the natural dynamics of play in a game and converge to the set of correlated equilibria. Despite their apparent differences, I show that these heuristics have an abstract representation as a sequence of probability distributions that...

The paper presents an evolutionary model, based on the assumption that agents may revise their current strategies if they previously failed to attain the maximum level of potential payoffs. We offer three versions of this reflexive mechanism, each one of which describes a distinct type:...

Individual behavioral differences in humans have been linked to measurable differences in their mental activities, including differences in their implicit motives. In humans, individual differences in the strength of motives such as power, achievement and affiliation have been shown to have a...

There are many competing game-theoretic analyses of terrorism. Most of these models suggest nonlinear relationships between terror attacks and some variable of interest. However, to date, there have been very few attempts to empirically sift between competing models of terrorism or identify...

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that...

We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.

A choice prediction competition is organized that focuses on decisions from experience in market entry games (http://sites.google.com/site/gpredcomp/ and http://www.mdpi.com/si/games/predict-behavior/). The competition is based on two experiments: An estimation experiment, and a competition...

We submitted three models to the competition which were based on the I-SAW model. The models introduced four new assumptions. In the first model an adjustment process was introduced through which the tendency for exploration was higher at the beginning and decreased over time in the exploration...