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

On finding an envy-free Pareto-optimal division

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

zbMath0920.90144MaRDI QIDQ1290667

J. H. Reijnierse, Jos A. M. Potters

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)


zbMATH Keywords

Pareto-optimalityWalras equilibriumenvy-freenesscake division


Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14)


Related Items (4)

Efficient Fair Division with Minimal Sharing ⋮ A comparison of formulations and solution methods for the minimum-envy location problem ⋮ Envy-Free Division of Land ⋮ Monotonicity and competitive equilibrium in cake-cutting






This page was built for publication: On finding an envy-free Pareto-optimal division

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1290667&oldid=13396759"
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 10:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki