On discrete preferences and coordination

作者：

Highlights：

• A class of “discrete preference games” is introduced and analyzed.

• Tight price of stability bounds for a graph version of Battle of the Sexes.

• Conditions on when the optimal solution is also a Nash equilibrium are provided.

摘要

•A class of “discrete preference games” is introduced and analyzed.•Tight price of stability bounds for a graph version of Battle of the Sexes.•Conditions on when the optimal solution is also a Nash equilibrium are provided.

论文关键词：Algorithmic game theory,Price of stability

论文评审过程：Received 20 March 2017, Revised 14 September 2017, Accepted 1 November 2017, Available online 22 November 2017, Version of Record 13 December 2017.

论文官网地址：https://doi.org/10.1016/j.jcss.2017.11.002