font
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 2017.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffaetal2017b,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/03/2017tist.pdf},
doi = {http://dx.doi.org/10.1145/3040967},
year = {2017},
date = {2017-02-11},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Chalkiadakis, Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios
A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem Journal Article
In: Artificial Intelligence Journal, pp. (accepted), 2017.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffa:etal:2017b,
title = {A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem},
author = {Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios Chalkiadakis},
url = {http://www.sciencedirect.com/science/article/pii/S0004370217300243},
year = {2017},
date = {2017-02-11},
journal = {Artificial Intelligence Journal},
pages = {(accepted)},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Alessandro Farinelli Georgios Chalkiadakis Filippo; Ramchurn, Sarvapali D.
Recommending Fair Payments for Large-Scale Social Ridesharing Proceedings Article
In: ACM Conference on Recommender Systems (Recsys), 2015.
Links | BibTeX | Tags: Coalition Formation, mas, Ridesharing
@inproceedings{bistaffaetal2015,
title = {Recommending Fair Payments for Large-Scale Social Ridesharing},
author = {Alessandro Farinelli Georgios Chalkiadakis Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/02/2015recsys.pdf},
year = {2015},
date = {2015-09-16},
booktitle = {ACM Conference on Recommender Systems (Recsys)},
keywords = {Coalition Formation, mas, Ridesharing},
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}
}
Zhao, Enrico H. Gerding Sarvapali D. Ramchurn Dengji; Jennings, Nicholas R.
Balanced Trade Reduction for Dual-Role Exchange Markets Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
Abstract | Links | BibTeX | Tags: Electric Vehicles, Energy, Game Theory, mechanism design, Ridesharing
@inproceedings{zhao:etal:2015,
title = {Balanced Trade Reduction for Dual-Role Exchange Markets},
author = {Enrico H. Gerding Sarvapali D. Ramchurn Dengji Zhao and Nicholas R. Jennings},
url = {http://eprints.soton.ac.uk/372050/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee’s trade reduc- tion approach, we propose a new trade reduction mech- anism, called balanced trade reduction, that is incen- tive compatible and also provides flexible trade-offs be- tween efficiency and deficit.},
keywords = {Electric Vehicles, Energy, Game Theory, mechanism design, Ridesharing},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 0000.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffaetal2017,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
doi = {http://dx.doi.org/10.1145/3040967},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 2017.
@article{bistaffaetal2017b,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/03/2017tist.pdf},
doi = {http://dx.doi.org/10.1145/3040967},
year = {2017},
date = {2017-02-11},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Chalkiadakis, Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios
A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem Journal Article
In: Artificial Intelligence Journal, pp. (accepted), 2017.
@article{bistaffa:etal:2017b,
title = {A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem},
author = {Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios Chalkiadakis},
url = {http://www.sciencedirect.com/science/article/pii/S0004370217300243},
year = {2017},
date = {2017-02-11},
journal = {Artificial Intelligence Journal},
pages = {(accepted)},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Alessandro Farinelli Georgios Chalkiadakis Filippo; Ramchurn, Sarvapali D.
Recommending Fair Payments for Large-Scale Social Ridesharing Proceedings Article
In: ACM Conference on Recommender Systems (Recsys), 2015.
@inproceedings{bistaffaetal2015,
title = {Recommending Fair Payments for Large-Scale Social Ridesharing},
author = {Alessandro Farinelli Georgios Chalkiadakis Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/02/2015recsys.pdf},
year = {2015},
date = {2015-09-16},
booktitle = {ACM Conference on Recommender Systems (Recsys)},
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.
@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}
}
Zhao, Enrico H. Gerding Sarvapali D. Ramchurn Dengji; Jennings, Nicholas R.
Balanced Trade Reduction for Dual-Role Exchange Markets Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{zhao:etal:2015,
title = {Balanced Trade Reduction for Dual-Role Exchange Markets},
author = {Enrico H. Gerding Sarvapali D. Ramchurn Dengji Zhao and Nicholas R. Jennings},
url = {http://eprints.soton.ac.uk/372050/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee’s trade reduc- tion approach, we propose a new trade reduction mech- anism, called balanced trade reduction, that is incen- tive compatible and also provides flexible trade-offs be- tween efficiency and deficit.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 0000.
@article{bistaffaetal2017,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
doi = {http://dx.doi.org/10.1145/3040967},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 2017.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffaetal2017b,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/03/2017tist.pdf},
doi = {http://dx.doi.org/10.1145/3040967},
year = {2017},
date = {2017-02-11},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Chalkiadakis, Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios
A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem Journal Article
In: Artificial Intelligence Journal, pp. (accepted), 2017.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffa:etal:2017b,
title = {A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem},
author = {Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios Chalkiadakis},
url = {http://www.sciencedirect.com/science/article/pii/S0004370217300243},
year = {2017},
date = {2017-02-11},
journal = {Artificial Intelligence Journal},
pages = {(accepted)},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Alessandro Farinelli Georgios Chalkiadakis Filippo; Ramchurn, Sarvapali D.
Recommending Fair Payments for Large-Scale Social Ridesharing Proceedings Article
In: ACM Conference on Recommender Systems (Recsys), 2015.
Links | BibTeX | Tags: Coalition Formation, mas, Ridesharing
@inproceedings{bistaffaetal2015,
title = {Recommending Fair Payments for Large-Scale Social Ridesharing},
author = {Alessandro Farinelli Georgios Chalkiadakis Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/02/2015recsys.pdf},
year = {2015},
date = {2015-09-16},
booktitle = {ACM Conference on Recommender Systems (Recsys)},
keywords = {Coalition Formation, mas, Ridesharing},
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}
}
Zhao, Enrico H. Gerding Sarvapali D. Ramchurn Dengji; Jennings, Nicholas R.
Balanced Trade Reduction for Dual-Role Exchange Markets Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
Abstract | Links | BibTeX | Tags: Electric Vehicles, Energy, Game Theory, mechanism design, Ridesharing
@inproceedings{zhao:etal:2015,
title = {Balanced Trade Reduction for Dual-Role Exchange Markets},
author = {Enrico H. Gerding Sarvapali D. Ramchurn Dengji Zhao and Nicholas R. Jennings},
url = {http://eprints.soton.ac.uk/372050/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee’s trade reduc- tion approach, we propose a new trade reduction mech- anism, called balanced trade reduction, that is incen- tive compatible and also provides flexible trade-offs be- tween efficiency and deficit.},
keywords = {Electric Vehicles, Energy, Game Theory, mechanism design, Ridesharing},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 0000.
Links | BibTeX | Tags: Coalition Formation, Ridesharing
@article{bistaffaetal2017,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
doi = {http://dx.doi.org/10.1145/3040967},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {Coalition Formation, Ridesharing},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 2017.
@article{bistaffaetal2017b,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/03/2017tist.pdf},
doi = {http://dx.doi.org/10.1145/3040967},
year = {2017},
date = {2017-02-11},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Chalkiadakis, Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios
A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem Journal Article
In: Artificial Intelligence Journal, pp. (accepted), 2017.
@article{bistaffa:etal:2017b,
title = {A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem},
author = {Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios Chalkiadakis},
url = {http://www.sciencedirect.com/science/article/pii/S0004370217300243},
year = {2017},
date = {2017-02-11},
journal = {Artificial Intelligence Journal},
pages = {(accepted)},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Alessandro Farinelli Georgios Chalkiadakis Filippo; Ramchurn, Sarvapali D.
Recommending Fair Payments for Large-Scale Social Ridesharing Proceedings Article
In: ACM Conference on Recommender Systems (Recsys), 2015.
@inproceedings{bistaffaetal2015,
title = {Recommending Fair Payments for Large-Scale Social Ridesharing},
author = {Alessandro Farinelli Georgios Chalkiadakis Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/02/2015recsys.pdf},
year = {2015},
date = {2015-09-16},
booktitle = {ACM Conference on Recommender Systems (Recsys)},
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.
@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}
}
Zhao, Enrico H. Gerding Sarvapali D. Ramchurn Dengji; Jennings, Nicholas R.
Balanced Trade Reduction for Dual-Role Exchange Markets Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{zhao:etal:2015,
title = {Balanced Trade Reduction for Dual-Role Exchange Markets},
author = {Enrico H. Gerding Sarvapali D. Ramchurn Dengji Zhao and Nicholas R. Jennings},
url = {http://eprints.soton.ac.uk/372050/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee’s trade reduc- tion approach, we propose a new trade reduction mech- anism, called balanced trade reduction, that is incen- tive compatible and also provides flexible trade-offs be- tween efficiency and deficit.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 0000.
@article{bistaffaetal2017,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
doi = {http://dx.doi.org/10.1145/3040967},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
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, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 2017.
@article{bistaffaetal2017b,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/03/2017tist.pdf},
doi = {http://dx.doi.org/10.1145/3040967},
year = {2017},
date = {2017-02-11},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Chalkiadakis, Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios
A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem Journal Article
In: Artificial Intelligence Journal, pp. (accepted), 2017.
@article{bistaffa:etal:2017b,
title = {A Cooperative Game-Theoretic Approach to the Social Ridesharing Problem},
author = {Sarvapali Alessandro Farinelli; Ramchurn Filippo Bistaffa Georgios Chalkiadakis},
url = {http://www.sciencedirect.com/science/article/pii/S0004370217300243},
year = {2017},
date = {2017-02-11},
journal = {Artificial Intelligence Journal},
pages = {(accepted)},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Bistaffa, Alessandro Farinelli Georgios Chalkiadakis Filippo; Ramchurn, Sarvapali D.
Recommending Fair Payments for Large-Scale Social Ridesharing Proceedings Article
In: ACM Conference on Recommender Systems (Recsys), 2015.
@inproceedings{bistaffaetal2015,
title = {Recommending Fair Payments for Large-Scale Social Ridesharing},
author = {Alessandro Farinelli Georgios Chalkiadakis Filippo Bistaffa and Sarvapali D. Ramchurn},
url = {https://www.sramchurn.com/wp-content/uploads/2017/02/2015recsys.pdf},
year = {2015},
date = {2015-09-16},
booktitle = {ACM Conference on Recommender Systems (Recsys)},
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.
@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}
}
Zhao, Enrico H. Gerding Sarvapali D. Ramchurn Dengji; Jennings, Nicholas R.
Balanced Trade Reduction for Dual-Role Exchange Markets Proceedings Article
In: Proceedings of the AAAI Conference, 2015.
@inproceedings{zhao:etal:2015,
title = {Balanced Trade Reduction for Dual-Role Exchange Markets},
author = {Enrico H. Gerding Sarvapali D. Ramchurn Dengji Zhao and Nicholas R. Jennings},
url = {http://eprints.soton.ac.uk/372050/},
year = {2015},
date = {2015-01-25},
booktitle = {Proceedings of the AAAI Conference},
abstract = {We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee’s trade reduc- tion approach, we propose a new trade reduction mech- anism, called balanced trade reduction, that is incen- tive compatible and also provides flexible trade-offs be- tween efficiency and deficit.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Bistaffa, Jesús Cerquides Alessandro Farinelli Filippo; Ramchurn, Sarvapali D.
Algorithms for Graph-Constrained Coalition Formation in the Real World Journal Article
In: ACM Transactions on Intelligent Systems and Technology (TIST), vol. 8, no. 4, 0000.
@article{bistaffaetal2017,
title = {Algorithms for Graph-Constrained Coalition Formation in the Real World},
author = {Jesús Cerquides Alessandro Farinelli Filippo Bistaffa and Sarvapali D. Ramchurn},
doi = {http://dx.doi.org/10.1145/3040967},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {8},
number = {4},
keywords = {},
pubstate = {published},
tppubtype = {article}
}