Pareto efficiency is a widely used property in solution concepts for cooperative and non--cooperative game--theoretic settings and, more generally, in multi--objective problems. However, finding or even approximating (when the objective functions are not convex) the Pareto curve is hard. Most of the literature focuses on computing concise representations to approximate the Pareto curve or on exploiting evolutionary approaches to generate approximately Pareto efficient samples of the curve. In this paper, we show that the Pareto curve of a bimatrix game can be found exactly in polynomial time and that it is composed of a polynomial number of pieces. Furthermore, each piece is a quadratic function. We use this result to provide algorithms for game-theoretic solution concepts that incorporate Pareto efficiency.
Finding the pareto curve in bimatrix games is easy
Published 2014 in Adaptive Agents and Multi-Agent Systems
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
Adaptive Agents and Multi-Agent Systems
- Publication date
2014-05-05
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-16 of 16 references · Page 1 of 1