Evaluating the performance of DCOP algorithms in a real world, dynamic problem

Evaluating the performance of DCOP algorithms in a real world, dynamic problem. Junges, R. & Bazzan, A. L. C. 05/2008 2008.

Paper abstract bibtex

Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network).

@conference {Junges:2008:EPD:1402298.1402308,
	title = {Evaluating the performance of DCOP algorithms in a real world, dynamic problem},
	booktitle = {AAMAS8 - Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems},
	series = {AAMAS {\textquoteright}08},
	year = {2008},
	month = {05/2008},
	pages = {599{\textendash}606},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Estoril, Portugal},
	abstract = {Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network).},
	keywords = {coordination, DCOP, distributed constraint optimization, traffic control},
	isbn = {978-0-9817381-1-6},
	url = {http://dl.acm.org/citation.cfm?id=1402298.1402308},
	author = {Junges, Robert and Bazzan, Ana L. C.}
}

Downloads: 0

{"_id":"BgX5TdAEQfk4C5La3","bibbaseid":"junges-bazzan-evaluatingtheperformanceofdcopalgorithmsinarealworlddynamicproblem-2008","downloads":0,"creationDate":"2018-07-03T04:50:27.941Z","title":"Evaluating the performance of DCOP algorithms in a real world, dynamic problem","author_short":["Junges, R.","Bazzan, A. L. C."],"year":2008,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Evaluating the performance of DCOP algorithms in a real world, dynamic problem","booktitle":"AAMAS8 - Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems","series":"AAMAS \\textquoteright08","year":"2008","month":"05/2008","pages":"599\\textendash606","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","organization":"International Foundation for Autonomous Agents and Multiagent Systems","address":"Estoril, Portugal","abstract":"Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network).","keywords":"coordination, DCOP, distributed constraint optimization, traffic control","isbn":"978-0-9817381-1-6","url":"http://dl.acm.org/citation.cfm?id=1402298.1402308","author":[{"propositions":[],"lastnames":["Junges"],"firstnames":["Robert"],"suffixes":[]},{"propositions":[],"lastnames":["Bazzan"],"firstnames":["Ana","L.","C."],"suffixes":[]}],"bibtex":"@conference {Junges:2008:EPD:1402298.1402308,\n\ttitle = {Evaluating the performance of DCOP algorithms in a real world, dynamic problem},\n\tbooktitle = {AAMAS8 - Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems},\n\tseries = {AAMAS {\\textquoteright}08},\n\tyear = {2008},\n\tmonth = {05/2008},\n\tpages = {599{\\textendash}606},\n\tpublisher = {International Foundation for Autonomous Agents and Multiagent Systems},\n\torganization = {International Foundation for Autonomous Agents and Multiagent Systems},\n\taddress = {Estoril, Portugal},\n\tabstract = {Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network).},\n\tkeywords = {coordination, DCOP, distributed constraint optimization, traffic control},\n\tisbn = {978-0-9817381-1-6},\n\turl = {http://dl.acm.org/citation.cfm?id=1402298.1402308},\n\tauthor = {Junges, Robert and Bazzan, Ana L. C.}\n}\n","author_short":["Junges, R.","Bazzan, A. L. C."],"key":"Junges:2008:EPD:1402298.1402308","id":"Junges:2008:EPD:1402298.1402308","bibbaseid":"junges-bazzan-evaluatingtheperformanceofdcopalgorithmsinarealworlddynamicproblem-2008","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=1402298.1402308"},"keyword":["coordination","DCOP","distributed constraint optimization","traffic control"],"downloads":0},"search_terms":["evaluating","performance","dcop","algorithms","real","world","dynamic","problem","junges","bazzan"],"keywords":["coordination","dcop","distributed constraint optimization","traffic control"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}