A cooperative game-theoretic approach to the social ridesharing problem

DOI10.1016/j.artint.2017.02.004zbMath1425.91029OpenAlexW2591420928MaRDI QIDQ2407882

Filippo Bistaffa, Georgios Chalkiadakis, Sarvapali D. Ramchurn, Alessandro Farinelli

Publication date: 6 October 2017

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/407399/1/2017aij.pdf

zbMATH Keywords

graphssocial networkscoalition formationridesharing

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Cooperative games (91A12) Games involving graphs (91A43)

Related Items (2)

How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the complexity of core, kernel, and bargaining set
• Coalition structure generation with worst case guarantees
• Optimization for dynamic ride-sharing: a review
• Characteristic function games with restricted agent interactions: core-stability and coalition structures
• The Truck Dispatching Problem
• Computing Shapley Value in Supermodular Coalitional Games
• Vehicle Routing
• Coalition Structure Generation over Graphs
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
• Graphs and Cooperation in Games
• On the Complexity of Cooperative Solution Concepts
• Ride Sharing with a Vehicle of Unlimited Capacity.
• Vehicle Routing Problem with Time Windows
• Convergent Transfer Schemes for N-Person Games
• The kernel of a cooperative game
• NP-completeness for calculating power indices of weighted majority games

This page was built for publication: A cooperative game-theoretic approach to the social ridesharing problem