Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Pareto set of the partition bargaining problem

From MaRDI portal
Publication:1192627
Jump to:navigation, search

DOI10.1016/0899-8256(91)90021-6zbMath0751.90099OpenAlexW1981609337MaRDI QIDQ1192627

Uriel G. Rothblum, Daniel Granot

Publication date: 27 September 1992

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0899-8256(91)90021-6


zbMATH Keywords

Nash solutionpartitioningPareto-optimalitybargaining game


Mathematics Subject Classification ID

Cooperative games (91A12)


Related Items

The partition bargaining problem ⋮ Biclustering in data mining ⋮ On bargaining for an indivisible good ⋮ Linear-shaped partition problems



Cites Work

  • Axiomatic bargaining theory on economic environments
  • Axiomatic models of bargaining
  • The Bargaining Problem
  • Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
  • Other Solutions to Nash's Bargaining Problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1192627&oldid=13250787"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki