Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/03D9D3AA-40E8-43D1-9E56-2BFCAF875CC6 | ||
| Year | 2016 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | F. Christianos and G. Chalkiadakis, "Employing hypergraphs for efficient coalition formation with application to the V2G problem," in 22nd European Conference on Artificial Intelligence, 2016, pp. 1604-1605. doi: 10.3233/978-1-61499-672-9-1604 https://doi.org/10.3233/978-1-61499-672-9-1604 | ||
| Appears in Collections |
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 algorithms, and exploit hypergraph structure to identify agents with desirable characteristics. Our approach allows the near-instantaneous formation of high quality coalitions, while adhering to multiple stated requirements regarding coalition quality. 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, realtime coalition formation for the V2G problem, while taking multiple criteria into account for creating electric vehicle coalitions.
Copyright © DIAS 2013
