font
Bistaffa, Sarvapali D. Ramchurn Alessandro Farinelli Filippo
Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
Abstract | Links | BibTeX | Tags: Coalition Formation, optimisation, Ridesharing, Social Networks
@inproceedings{bistaffa:etal:2015,
title = {Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing},
author = {Sarvapali D. Ramchurn Alessandro Farinelli Filippo Bistaffa},
url = {http://eprints.soton.ac.uk/372048/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, ar- range one-time rides at a very short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system mod- elling such problem as a graph constrained coalition forma- tion (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the ap- plicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to −36.22%). More- over, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds).},
keywords = {Coalition Formation, optimisation, Ridesharing, Social Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Sarvapali D. Ramchurn Alessandro Farinelli Filippo
Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{bistaffa:etal:2015,
title = {Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing},
author = {Sarvapali D. Ramchurn Alessandro Farinelli Filippo Bistaffa},
url = {http://eprints.soton.ac.uk/372048/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, ar- range one-time rides at a very short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system mod- elling such problem as a graph constrained coalition forma- tion (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the ap- plicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to −36.22%). More- over, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Sarvapali D. Ramchurn Alessandro Farinelli Filippo
Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
Abstract | Links | BibTeX | Tags: Coalition Formation, optimisation, Ridesharing, Social Networks
@inproceedings{bistaffa:etal:2015,
title = {Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing},
author = {Sarvapali D. Ramchurn Alessandro Farinelli Filippo Bistaffa},
url = {http://eprints.soton.ac.uk/372048/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, ar- range one-time rides at a very short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system mod- elling such problem as a graph constrained coalition forma- tion (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the ap- plicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to −36.22%). More- over, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds).},
keywords = {Coalition Formation, optimisation, Ridesharing, Social Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Sarvapali D. Ramchurn Alessandro Farinelli Filippo
Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{bistaffa:etal:2015,
title = {Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing},
author = {Sarvapali D. Ramchurn Alessandro Farinelli Filippo Bistaffa},
url = {http://eprints.soton.ac.uk/372048/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, ar- range one-time rides at a very short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system mod- elling such problem as a graph constrained coalition forma- tion (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the ap- plicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to −36.22%). More- over, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Multi-agent signal-less intersection management with dynamic platoon formation
AI Foundation Models: initial review, CMA Consultation, TAS Hub Response
The effect of data visualisation quality and task density on human-swarm interaction
Demonstrating performance benefits of human-swarm teaming
Bistaffa, Sarvapali D. Ramchurn Alessandro Farinelli Filippo
Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{bistaffa:etal:2015,
title = {Sharing Rides with Friends: a Coalition Formation Algorithm for Ridesharing},
author = {Sarvapali D. Ramchurn Alessandro Farinelli Filippo Bistaffa},
url = {http://eprints.soton.ac.uk/372048/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, ar- range one-time rides at a very short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system mod- elling such problem as a graph constrained coalition forma- tion (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the ap- plicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to −36.22%). More- over, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}