A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES
From MaRDI portal
Publication:3402024
DOI10.1142/S0219198909002212zbMath1188.91017OpenAlexW2088408695MaRDI QIDQ3402024
V. Rubiales, Luisa Monroy, Amparo M. Mármol
Publication date: 2 February 2010
Published in: International Game Theory Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219198909002212
Multi-objective and goal programming (90C29) Cooperative games (91A12) Linear programming (90C05) (n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- An analog of the minimax theorem for vector payoffs
- Generalized maximin solutions in multicriteria bargaining
- An equitable solution for multicriteria bargaining games
- Solution concepts in two-person multicriteria games
- The equilibria of a multiple objective game
- Games with multiple payoffs
- Domination structures and multicriteria problems in N-person games
- Cone concavity and multiple-payoff constrained \(n\)-person games
- Multicriteria goal games
- Two-person non-zero-sum games as multicriteria goal games
- Pareto-optimal security strategies as minimax strategies of a standard matrix game
- Noncooperative games with vector payoffs under relative pseudomonotonicity
- The structure of the set of equilibria for two person multicriteria games.
- Vector linear programming in zero-sum multicriteria matrix games
- EXISTENCE OF GENERALISED PARETO EQUILIBRIA FOR CONSTRAINED MULTIOBJECTIVE GAMES
- The Bargaining Problem
- Individual Monotonicity and Lexicographic Maxmin Solution
- Two-Person Cooperative Games
This page was built for publication: A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES