Related Experiment Video
Updated: Sep 11, 2025

The HoneyComb Paradigm for Research on Collective Human Behavior
Published on: January 19, 2019
Human adaptation to adaptive machines converges to game-theoretic equilibria
Benjamin J Chasnov1, Lillian J Ratliff1, Samuel A Burden2
1Department of Electrical & Computer Engineering, University of Washington, Seattle, WA, 98195, USA.
None:
Here we test three learning algorithms for machines playing general-sum games with human subjects. The algorithms enable the machine to select the outcome of the co-adaptive interaction from a constellation of game-theoretic equilibria in action and policy spaces. Importantly, the machine learning algorithms work directly from observations of human actions without solving an inverse problem to estimate the human's utility function as in prior work. Surprisingly, one algorithm can steer the human-machine interaction to the machine's optimum, effectively controlling the human's actions even while the human responds optimally to their perceived cost landscape. Our results show that game theory can be used to predict and design outcomes of co-adaptive interactions between intelligent humans and machines.
Related Concept Videos
Natural Selection and Adaptation
Beyond physical adaptations,...
Limits to Natural Selection
Schemas
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Evolutionary Psychology
Social Facilitation

