Majorization on a partially ordered set
HTML articles powered by AMS MathViewer
- by F. K. Hwang PDF
- Proc. Amer. Math. Soc. 76 (1979), 199-203 Request permission
Abstract:
We extend the classical concept of set majorization to the case where the set is partially ordered. We give a useful property which characterizes majorization on a partially ordered set. Quite unexpectedly, the proof of this property relies on a theorem of Shapley on convex games. We also give a theorem which is parallel to the Schur-Ostrowski theorem in comparing two sets of parameters in a function.References
- F. R. K. Chung and F. K. Hwang, On blocking probabilities for a class of linear graphs, Bell System Tech. J. 57 (1978), no. 8, 2915–2925. MR 508235, DOI 10.1002/j.1538-7305.1978.tb02183.x G. H. Hardy, J. E. Littlewood and G. Pólya, Inequalities, 2nd ed., Cambridge Univ. Press, New York, 1959.
- F. K. Hwang, Generalized Huffman trees, SIAM J. Appl. Math. 37 (1979), no. 1, 124–127. MR 536306, DOI 10.1137/0137008
- Alexandre Ostrowski, Sur quelques applications des fonctions convexes et concaves au sens de I. Schur, J. Math. Pures Appl. (9) 31 (1952), 253–292 (French). MR 52475 I. Schur, Über ein Klasse von Mittelbildungen mit Anwendungen auf die Determinantentheorie, Sitzungsber. Berlin. Math. Ges. 22 (1923), 9-20.
- Lloyd S. Shapley, Cores of convex games, Internat. J. Game Theory 1 (1971/72), 11–26; errata, ibid. 1 (1971/72), 199. MR 311338, DOI 10.1007/BF01753431
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 76 (1979), 199-203
- MSC: Primary 06A10; Secondary 26B35
- DOI: https://doi.org/10.1090/S0002-9939-1979-0537073-0
- MathSciNet review: 537073