Coordination and adaptation in impromptu teams
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
To teach or not to teach?: decision making under uncertainty in ad hoc teams
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Comparative evaluation of MAL algorithms in a diverse set of ad hoc team problems
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Ad hoc coordination in multiagent systems with applications to human-machine interaction
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
The ad hoc coordination problem is to design an ad hoc agent which is able to achieve optimal flexibility and efficiency in a multiagent system that admits no prior coordination between the ad hoc agent and the other agents. We conceptualise this problem formally as a stochastic Bayesian game in which the behaviour of a player is determined by its type. Based on this model, we derive a solution, called Harsanyi-Bellman Ad Hoc Coordination (HBA), which utilises a set of user-defined types to characterise players based on their observed behaviours. We evaluate HBA in the level-based foraging domain, showing that it outperforms several alternative algorithms using just a few user-defined types. We also report on a human-machine experiment in which the humans played Prisoner's Dilemma and Rock-Paper-Scissors against HBA and alternative algorithms. The results show that HBA achieved equal efficiency but a significantly higher welfare and winning rate.