z-logo
open-access-imgOpen Access
Algorithms for Finding Approximate Formations in Games
Author(s) -
Patrick R. Jordan,
Michael P. Wellman
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7635
Subject(s) - class (philosophy) , closure (psychology) , space (punctuation) , computer science , combinatorial game theory , nash equilibrium , limit (mathematics) , best response , mathematical optimization , game theory , repeated game , function (biology) , mathematics , theoretical computer science , mathematical economics , artificial intelligence , mathematical analysis , economics , market economy , operating system , evolutionary biology , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom