Given a set of user location preferences, the FRVP problem is to determine a location among

the proposed ones such that the maximum distance between

this location and all other users’ locations is minimized,

i.e. it is fair to all users.