The ordered field property and a finite algorithm for the Nash bargaining solution

DOI10.1007/BF01253777zbMath0751.90101MaRDI QIDQ1185756

S. Singh

Publication date: 28 June 1992

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

ordered fieldbargaining solutioncomputation of equilibria

Mathematics Subject Classification ID

Cooperative games (91A12) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Expected utility theory with probability grids and preference formation ⋮ On the implementation of the L-Nash bargaining solution in two-person bargaining games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive proof of the min-max theorem
• An orderfield property for stochastic games when one player controls transition probabilities
• Axiomatic models of bargaining
• A finite algorithm for the switching control stochastic game
• The Bargaining Problem
• AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
• An Axiomatic Approach to Measurable Utility
• Stochastic Games

This page was built for publication: The ordered field property and a finite algorithm for the Nash bargaining solution