Envy\mbox{-}free Trip Planning in Group Trip Planning Query Problem
Mayank Singhal, Suman Banerjee

TL;DR
This paper introduces the Envy-Free Group Trip Planning Query, which considers individual travel fairness among group members while minimizing total travel distance, proposing solutions and demonstrating improved results over baselines.
Contribution
It formulates a novel envy-free trip planning problem with fairness constraints and develops efficient algorithms to solve it, including a surrogate problem for cases with no feasible solutions.
Findings
Proposed algorithms achieve less total travel distance than baseline methods.
Solutions maintain individual travel fairness within a specified threshold D.
Experimental results show reasonable computational overhead.
Abstract
In recent times, Group Trip Planning Query (henceforth referred to as GTP Query) is one of the well\mbox{-}studied problems in Spatial Databases. The inputs to the problem are a road network where the vertices represent the Point-of-Interests (mentioned as POIs henceforth) and they are grouped into different categories, edges represent the road segments, and edge weight represents the distance and a group of users along with their source and destination location. This problem asks to return one POI from every category such that the aggregated distance traveled by the group is minimized. As the objective is to minimize the aggregated distance, the existing solution methodologies do not consider the individual distances traveled by the group members. To address this issue, we introduce and study the \textsc{Envy Free Group Trip Planning Query} Problem. Along with the inputs of the GTP…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Geographic Information Systems Studies · Internet Traffic Analysis and Secure E-voting
