Abstract
In this paper, we consider the problem of Pareto optimal allocation in a general framework, involving preference functionals defined on a general real vector space. The optimization problem is equivalent to a modified sup-convolution of the different agents’ preference functionals. The results are then applied to a multi-period setting and some further characterization of Pareto optimality for an allocation is obtained for expected utility for processes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
