On the maximum number of balancing subsets

DOI10.1016/0304-4068(84)90011-9zbMath0553.05001OpenAlexW2026558182WikidataQ127741144 ScholiaQ127741144MaRDI QIDQ801907

Seiji Nabeya

Publication date: 1984

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4068(84)90011-9

zbMATH Keywords

combinatorial problemmaximum number of balancing subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

On structural decompositions of finite frames, The maximum number of balancing sets, Walras degrees and probability of a blocking coalition at Pareto allocations

Cites Work

• Walras degrees and probability of a blocking coalition at Pareto allocations