Nash Equilibrium in Games on Graphs with Incomplete Preferences
<|reference_start|>Nash Equilibrium in Games on Graphs with Incomplete Preferences: Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem of computing Nash equilibrium in a subclass of two-player games played on graphs where each player seeks to maximally satisfy their (possibly incomplete) preferences over a set of temporal goals. We characterize the Nash equilibrium and prove its existence in scenarios where player preferences are fully aligned, partially aligned, and completely opposite, in terms of the well-known solution concepts of sure winning and Pareto efficiency. When preferences are partially aligned, we derive conditions under which a player needs cooperation and demonstrate that the Nash equilibria depend not only on the preference alignment but also on whether the players need cooperation to achieve a better outcome and whether they are willing to cooperate.We illustrate the theoretical results by solving a mechanism design problem for a drone delivery scenario.<|reference_end|>
@article{kulkarni2024nash,
    title={Nash Equilibrium in Games on Graphs with Incomplete Preferences},
    author={Abhishek N. Kulkarni, Jie Fu, and Ufuk Topcu},
    journal={arXiv preprint arXiv:2408.02860},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.02860},
    primaryClass={cs.GT}
}