Abstract
A game of love and hate is one in which a player’s payoff is a function of her own action and the payoffs of other players. For each action profile, the associated payoff profile solves an interdependent utility system, and if that solution is bounded and unique for every profile we call the game coherent. Coherent games generate a standard normal form. Our central theorem states that every Nash equilibrium of such a game is Pareto optimal, in sharp contrast to the general prevalence of inefficient equilibria in the presence of externalities. While externalities in our model are restricted to flow only through payoffs there are no other constraints: they could be positive or negative, or of varying sign. We further show that our coherence and continuity requirements are tight.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.