Technical Note—Generalized Efficient Solutions for Sums of Sets | Zendy

D. J. White | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Generalized Efficient Solutions for Sums of Sets

Author(s) -

D. J. White

Publication year - 1980

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.28.3.844

Subject(s) - set (abstract data type) , component (thermodynamics) , finite set , mathematics , computer science , mathematical optimization , combinatorics , algebra over a field , mathematical economics , discrete mathematics , pure mathematics , mathematical analysis , physics , thermodynamics , programming language

Moskowitz developed a useful algorithm for finding admissible decision functions by viewing the expected utility vectors over a finite number of states as the sum of component vectors and developing a recurrence approach. This paper generalizes the results to sum set situations and corrects Moskowitz's proof.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research