Two approximation algorithms for probabilistic coalition structure generation with quality bound. Matsumura, K., Kodric, B., Okimoto, T., & Hirayama, K. Auton. Agents Multi Agent Syst., 34(1):25, 2020. Paper doi bibtex @article{matsumura_two_2020,
author = {Matsumura, Kouki and Kodric, Bojana and Okimoto, Tenda and Hirayama, Katsutoshi},
doi = {10.1007/s10458-020-09449-8},
journal = {Auton. Agents Multi Agent Syst.},
number = {1},
pages = {25},
title = {Two approximation algorithms for probabilistic coalition structure generation with quality bound},
url = {https://doi.org/10.1007/s10458-020-09449-8},
volume = {34},
year = {2020},
Bdsk-Url-1 = {https://doi.org/10.1007/s10458-020-09449-8}}
Downloads: 0
{"_id":"Y7kvCQKQrg4hbkRwi","bibbaseid":"matsumura-kodric-okimoto-hirayama-twoapproximationalgorithmsforprobabilisticcoalitionstructuregenerationwithqualitybound-2020","author_short":["Matsumura, K.","Kodric, B.","Okimoto, T.","Hirayama, K."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Matsumura"],"firstnames":["Kouki"],"suffixes":[]},{"propositions":[],"lastnames":["Kodric"],"firstnames":["Bojana"],"suffixes":[]},{"propositions":[],"lastnames":["Okimoto"],"firstnames":["Tenda"],"suffixes":[]},{"propositions":[],"lastnames":["Hirayama"],"firstnames":["Katsutoshi"],"suffixes":[]}],"doi":"10.1007/s10458-020-09449-8","journal":"Auton. Agents Multi Agent Syst.","number":"1","pages":"25","title":"Two approximation algorithms for probabilistic coalition structure generation with quality bound","url":"https://doi.org/10.1007/s10458-020-09449-8","volume":"34","year":"2020","bdsk-url-1":"https://doi.org/10.1007/s10458-020-09449-8","bibtex":"@article{matsumura_two_2020,\n\tauthor = {Matsumura, Kouki and Kodric, Bojana and Okimoto, Tenda and Hirayama, Katsutoshi},\n\tdoi = {10.1007/s10458-020-09449-8},\n\tjournal = {Auton. Agents Multi Agent Syst.},\n\tnumber = {1},\n\tpages = {25},\n\ttitle = {Two approximation algorithms for probabilistic coalition structure generation with quality bound},\n\turl = {https://doi.org/10.1007/s10458-020-09449-8},\n\tvolume = {34},\n\tyear = {2020},\n\tBdsk-Url-1 = {https://doi.org/10.1007/s10458-020-09449-8}}\n\n","author_short":["Matsumura, K.","Kodric, B.","Okimoto, T.","Hirayama, K."],"key":"matsumura_two_2020","id":"matsumura_two_2020","bibbaseid":"matsumura-kodric-okimoto-hirayama-twoapproximationalgorithmsforprobabilisticcoalitionstructuregenerationwithqualitybound-2020","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10458-020-09449-8"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://drive.google.com/uc?export=download&id=19WpQhoMIwJIL1DMqKywl2YoH2M7MIki5","dataSources":["RKZzE9qbnqyegdbZi","kCt8NvHdC72dHkmfu"],"keywords":[],"search_terms":["two","approximation","algorithms","probabilistic","coalition","structure","generation","quality","bound","matsumura","kodric","okimoto","hirayama"],"title":"Two approximation algorithms for probabilistic coalition structure generation with quality bound","year":2020}