Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/D5A29680-8121-4E48-902D-C7E5233079AC | - |
| Identifier | https://link.springer.com/chapter/10.1007%2F978-3-319-59294-7_9 | - |
| Identifier | https://doi.org/10.1007/978-3-319-59294-7_9 | - |
| Language | en | - |
| Extent | 17 pages | en |
| Title | Efficient multi-criteria coalition formation using hypergraphs (with application to the V2G problem) | en |
| Creator | Christianos Filippos | en |
| Creator | Χριστιανος Φιλιππος | el |
| Creator | Chalkiadakis Georgios | en |
| Creator | Χαλκιαδακης Γεωργιος | el |
| Publisher | Springer Verlag | en |
| Content Summary | This paper proposes, for the first time in the literature, the use of hypergraphs for the efficient formation of effective coalitions. We put forward several formation methods that build on existing hypergraph pruning, transversal, and clustering algorithms, and exploit the hypergraph structure to identify agents with desirable characteristics. Our approach allows the near-instantaneous formation of high quality coalitions, adhering to multiple stated quality requirements. Moreover, our methods are shown to scale to dozens of thousands of agents within fractions of a second; with one of them scaling to even millions of agents within seconds. We apply our approach to the problem of forming coalitions to provide (electric) vehicle-to-grid (V2G) services. Ours is the first approach able to deal with large-scale, real-time coalition formation for the V2G problem, while taking multiple criteria into account for creating the electric vehicle coalitions. | en |
| Type of Item | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Full Paper | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2018-06-04 | - |
| Date of Publication | 2017 | - |
| Subject | Hypergraphs | en |
| Bibliographic Citation | F. Christianos and G. Chalkiadakis, "Efficient multi-criteria coalition formation using hypergraphs (with application to the V2G problem)," in 14th European Conference on Multi-Agent Systems, 2017, pp. 92-108. doi: 10.1007/978-3-319-59294-7_9 | en |
Copyright © DIAS 2013
