Abstract

Semi-cooperative games in strategic form are considered in which either a negotiation among the n players determines their actions or else an arbitrator specifies them. Methods are presented for selecting such action profiles by using multiple-objective optimization techniques. In particular, a scalar equilibrium (SE) is an action profile for the n players that maximize a utility function over the acceptable joint actions. Thus the selection of “solutions” to the game involves the selection of an acceptable utility function. In a greedy SE, the goal is to assign individual actions giving each player the largest payoff jointly possible. In a compromise SE, the goal is to make individual player payoffs equitable, while a satisficing SE achieves a target payoff level while weighting each player for possible additional payoff. These SEs are formally defined and shown to be Pareto optimal over the acceptable joint actions of the players. The advantage of these SEs is that they involve only pure strategies that are easily computed. Examples are given, including some well-known coordination games, and the worst-case time complexity for obtaining these SEs is shown to be linear in the number of individual payoffs in the payoff matrix. Finally, the SEs of this paper are checked against some standard game-theoretic bargaining axioms.

Highlights

  • Game theory is the study of strategic interactions among n rational decision makers called agents, whose decisions affect each other

  • This solution in mixed strategies involves a competitive component in which neither player will accept less than his status quo payoff, as well as a cooperative component modeled by the Nash product in which the players share in the benefits of cooperation

  • An scalar equilibrium (SE) is an action profile s* ∈ Ω determined from a decision criterion involving an aggregate utility function T : u ( S ) → R1 for all players in I that induces a preference relation ≤T on u (Ω) as described in [40]

Read more

Summary

Introduction

Game theory is the study of strategic interactions among n rational decision makers called agents (or players), whose decisions affect each other. An early example of such a game was considered by Nash [23], who presents a unique solution for a two-person bargaining problem in strategic form with complete information This solution in mixed strategies involves a competitive component in which neither player will accept less than his status quo payoff, as well as a cooperative component modeled by the Nash product in which the players share in the benefits of cooperation. The SE approach extends the classic bargaining results of (23), (36), and (37), for example, to n players and to different decision criteria It restricts previous results for semi-cooperative games to the more difficult and practical problem of obtaining pure strategies.

Preliminaries
Greedy Scalar Equilibrium
Result
The worst-case time complexity for obtaining all GSEs for Γn is
Compromise Scalar Equilibrium
Satisficing Scalar Equilibrium
Axiomatic Considerations
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call