Evolving Cooperation Strategies. Haynes, T., Wainwright, R., & Sen, S. Technical Report UTULSA-MCS-94-10, The University of Tulsa, Tulsa, OK, USA, 16 December, 1994.
Paper abstract bibtex The identification, design, and implementation of strategies for cooperation is a central research issue in the field of Distributed Artificial Intelligence (DAI). We propose a novel approach to the construction of cooperation strategies for a group of problem solvers based on the Genetic Programming (GP) paradigm. GP's are a class of adaptive algorithms used to evolve solution structures that optimize a given evaluation criterion. Our approach is based on designing a representation for cooperation strategies that can be manipulated by GPs. We present results from experiments in the predator-prey domain, which has been extensively studied as an easy-to-describe but difficult-to-solve cooperation problem domain. They key aspect of our approach is the minimal reliance on domain knowledge and human intervention in the construction of good cooperation strategies. Promising comparison results with prior systems lend credence to the viability of this approach.
@techreport{Hayes:1994:ecs,
abstract = {The identification, design, and implementation of
strategies for cooperation is a central research issue
in the field of Distributed Artificial Intelligence
(DAI). We propose a novel approach to the construction
of cooperation strategies for a group of problem
solvers based on the Genetic Programming (GP) paradigm.
GP's are a class of adaptive algorithms used to evolve
solution structures that optimize a given evaluation
criterion. Our approach is based on designing a
representation for cooperation strategies that can be
manipulated by GPs. We present results from experiments
in the predator-prey domain, which has been extensively
studied as an easy-to-describe but difficult-to-solve
cooperation problem domain. They key aspect of our
approach is the minimal reliance on domain knowledge
and human intervention in the construction of good
cooperation strategies. Promising comparison results
with prior systems lend credence to the viability of
this approach.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Tulsa, OK, USA},
author = {Haynes, Thomas and Wainwright, Roger and Sen, Sandip},
biburl = {https://www.bibsonomy.org/bibtex/25918559adfac21304e9947811d269caf/brazovayeye},
institution = {The University of Tulsa},
interhash = {4a74b22710deb7de981d9ad592f5c8f2},
intrahash = {5918559adfac21304e9947811d269caf},
keywords = {genetic algorithms, ccoperation strategies programming,},
month = {16 December},
number = {UTULSA-MCS-94-10},
size = {9 pages},
timestamp = {2008-06-19T17:41:10.000+0200},
title = {Evolving Cooperation Strategies},
type = {Technical Report},
url = {http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf},
year = 1994
}
Downloads: 0
{"_id":"NZxiQyStfAeyKJ3GP","bibbaseid":"haynes-wainwright-sen-evolvingcooperationstrategies-1994","authorIDs":[],"author_short":["Haynes, T.","Wainwright, R.","Sen, S."],"bibdata":{"bibtype":"techreport","type":"Technical Report","abstract":"The identification, design, and implementation of strategies for cooperation is a central research issue in the field of Distributed Artificial Intelligence (DAI). We propose a novel approach to the construction of cooperation strategies for a group of problem solvers based on the Genetic Programming (GP) paradigm. GP's are a class of adaptive algorithms used to evolve solution structures that optimize a given evaluation criterion. Our approach is based on designing a representation for cooperation strategies that can be manipulated by GPs. We present results from experiments in the predator-prey domain, which has been extensively studied as an easy-to-describe but difficult-to-solve cooperation problem domain. They key aspect of our approach is the minimal reliance on domain knowledge and human intervention in the construction of good cooperation strategies. Promising comparison results with prior systems lend credence to the viability of this approach.","added-at":"2008-06-19T17:35:00.000+0200","address":"Tulsa, OK, USA","author":[{"propositions":[],"lastnames":["Haynes"],"firstnames":["Thomas"],"suffixes":[]},{"propositions":[],"lastnames":["Wainwright"],"firstnames":["Roger"],"suffixes":[]},{"propositions":[],"lastnames":["Sen"],"firstnames":["Sandip"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/25918559adfac21304e9947811d269caf/brazovayeye","institution":"The University of Tulsa","interhash":"4a74b22710deb7de981d9ad592f5c8f2","intrahash":"5918559adfac21304e9947811d269caf","keywords":"genetic algorithms, ccoperation strategies programming,","month":"16 December","number":"UTULSA-MCS-94-10","size":"9 pages","timestamp":"2008-06-19T17:41:10.000+0200","title":"Evolving Cooperation Strategies","url":"http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf","year":"1994","bibtex":"@techreport{Hayes:1994:ecs,\n abstract = {The identification, design, and implementation of\n strategies for cooperation is a central research issue\n in the field of Distributed Artificial Intelligence\n (DAI). We propose a novel approach to the construction\n of cooperation strategies for a group of problem\n solvers based on the Genetic Programming (GP) paradigm.\n GP's are a class of adaptive algorithms used to evolve\n solution structures that optimize a given evaluation\n criterion. Our approach is based on designing a\n representation for cooperation strategies that can be\n manipulated by GPs. We present results from experiments\n in the predator-prey domain, which has been extensively\n studied as an easy-to-describe but difficult-to-solve\n cooperation problem domain. They key aspect of our\n approach is the minimal reliance on domain knowledge\n and human intervention in the construction of good\n cooperation strategies. Promising comparison results\n with prior systems lend credence to the viability of\n this approach.},\n added-at = {2008-06-19T17:35:00.000+0200},\n address = {Tulsa, OK, USA},\n author = {Haynes, Thomas and Wainwright, Roger and Sen, Sandip},\n biburl = {https://www.bibsonomy.org/bibtex/25918559adfac21304e9947811d269caf/brazovayeye},\n institution = {The University of Tulsa},\n interhash = {4a74b22710deb7de981d9ad592f5c8f2},\n intrahash = {5918559adfac21304e9947811d269caf},\n keywords = {genetic algorithms, ccoperation strategies programming,},\n month = {16 December},\n number = {UTULSA-MCS-94-10},\n size = {9 pages},\n timestamp = {2008-06-19T17:41:10.000+0200},\n title = {Evolving Cooperation Strategies},\n type = {Technical Report},\n url = {http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf},\n year = 1994\n}\n\n","author_short":["Haynes, T.","Wainwright, R.","Sen, S."],"key":"Hayes:1994:ecs","id":"Hayes:1994:ecs","bibbaseid":"haynes-wainwright-sen-evolvingcooperationstrategies-1994","role":"author","urls":{"Paper":"http://www.mcs.utulsa.edu/~rogerw/papers/Haynes-icmas95.pdf"},"keyword":["genetic algorithms","ccoperation strategies programming",""],"downloads":0},"bibtype":"techreport","biburl":"http://www.bibsonomy.org/bib/author/wainwright?items=1000","creationDate":"2019-07-11T17:45:21.897Z","downloads":0,"keywords":["genetic algorithms","ccoperation strategies programming",""],"search_terms":["evolving","cooperation","strategies","haynes","wainwright","sen"],"title":"Evolving Cooperation Strategies","year":1994,"dataSources":["9g7YFYRTAHoh4aFeS"]}