Cone Concavity and Multiple-Payoff Constrained n-Person Games1

    loading  Checking for direct PDF access through Ovid

Abstract

This paper investigates special cases of abstract economies, i.e., n-person games with multiple payoff functions. Dominances with certain convex cones and interactive strategies are introduced in such game settings. Gradients of payoff functions are involved to establish certain Lagrange or Kuhn–Tucker conditions which may lead to some algorithms to actually compute an equilibrium. Sufficient and necessary conditions for such multiple payoff constrained n-person games are obtained.

Related Topics

    loading  Loading Related Articles