Players adaptively learn how to bargain. A characteristic function describes the available surplus. The underlying bargaining game extends the Nash demand game by allowing subcoalitions to reach an agreement. Players' demands must be multiples of a money unit. We show that stochastically stable...

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...