-

 

 

 




Optimization Online





 

Dual equilibrium problems: how a succession of aspiration points converges to an equilibrium

Felipe Garcia Moreno(fgarcia***at***ci.ufpb.br)
Paulo Roberto Oliveira(poliveir***at***cos.ufrj.br)
Antoine Soubeyran(antoine.soubeyran***at***gmail.com)

Abstract: We consider an equilibrium problem defined on a convex set, whose cost bifunction may not be monotone. We show that this problem can be solved by the inexact partial proximal method with quasi distance. As an application, at the psychological level of behavioral dynamics, this paper shows two points: i) how a dual equilibrium problem offers a model of behavioral trap, ``easy enough to reach, difficult enough to leave", which is both an aspiration point and an equilibrium, and ii) how a succession of aspiration points converges to an equilibrium, using worthwhile changes during the goal pursuit.

Keywords: Nonlinear programming, Nash equilibrium problems, quasi distance, partial proximal method, variational rationality

Category 1: Nonlinear Optimization

Category 2: Applications -- OR and Management Sciences (Other )

Citation:

Download: [PDF]

Entry Submitted: 05/19/2013
Entry Accepted: 05/19/2013
Entry Last Modified: 05/19/2013

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society