English

Quasi-Leontief utility functions on partially ordered sets I: efficient points

Optimization and Control 2011-02-15 v1

Abstract

A function u:XRu: X\to\mathbb{R} defined on a partially ordered set is quasi-Leontief if, if for all xXx\in X, the upper level set {xX:u(x)u(x)}\{x^\prime\in X: u(x^\prime)\geqslant u(x)\} has a smallest element. A function u:j=1nXjRu: \prod_{j=1}^nX_j\to\mathbb{R} whose partial functions obtained by freezing n1n-1 of the variables are all quasi-Leontief is an individually quasi-Leontief function; a point xx of the product space is an efficient point for uu if it is a minimal element of {xX:u(x)u(x)}\{x^\prime\in X: u(x^\prime)\geqslant u(x)\} . Part I deals with the maximisation of quasi-Leontief functions and the existence of efficient maximizers. Part II is concerned with the existence of efficient Nash equilibria for abstract games whose payoff functions are individually quasi-Leontief. Order theoretical and algebraic arguments are dominant in the first part while, in the second part, topology is heavily involved. In the framework and the language of tropical algebras, our quasi-Leontief functions are the additive functions defined on a semimodule with values in the semiring of scalars.

Cite

@article{arxiv.1102.2710,
  title  = {Quasi-Leontief utility functions on partially ordered sets I: efficient points},
  author = {Walter Briec and QiBin Liang and Charles Horvath},
  journal= {arXiv preprint arXiv:1102.2710},
  year   = {2011}
}
R2 v1 2026-06-21T17:25:45.251Z