IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i4p2786-2802.html

Joint Mixability and Notions of Negative Dependence

Author

Listed:
  • Takaaki Koike

    (Graduate School of Economics, Hitotsubashi University, Tokyo 186-8601, Japan)

  • Liyuan Lin

    (Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Ruodu Wang

    (Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

Abstract

A joint mix (JM) is a random vector with a constant component-wise sum. The dependence structure of a joint mix minimizes some common objectives, such as the variance of the component-wise sum, and it is regarded as a concept of extremal negative dependence. In this paper, we explore the connection between the joint mix structure and popular notions of negative dependence in statistics, such as negative correlation dependence, negative orthant dependence, and negative association. A joint mix is not always negatively dependent in any of these senses, but some natural classes of joint mixes are. We derive various necessary and sufficient conditions for a joint mix to be negatively dependent and study the compatibility of these notions. For identical marginal distributions, we show that a negatively dependent joint mix solves a multimarginal optimal transport problem for quadratic cost under a novel setting of uncertainty. Analysis of this optimal transport problem with heterogeneous marginals reveals a trade-off between negative dependence and the joint mix structure.

Suggested Citation

  • Takaaki Koike & Liyuan Lin & Ruodu Wang, 2024. "Joint Mixability and Notions of Negative Dependence," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2786-2802, November.
    • Handle: RePEc:inm:ormoor:v:49:y:2024:i:4:p:2786-2802
    DOI: 10.1287/moor.2022.0121
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0121
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.0121?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ruodu Wang & Liang Peng & Jingping Yang, 2013. "Bounds for the sum of dependent risks and worst Value-at-Risk with monotone marginal densities," Finance and Stochastics, Springer, vol. 17(2), pages 395-417, April.
    2. E. G. Coffman & M. Yannakakis, 1984. "Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 384-390, August.
    3. Alfred Galichon, 2016. "Optimal Transport Methods in Economics," Economics Books, Princeton University Press, edition 1, number 10870, December.
    4. Jean-Gabriel Lauzier & Liyuan Lin & Ruodu Wang, 2023. "Pairwise counter-monotonicity," Papers 2302.11701, arXiv.org, revised May 2023.
    5. Lauzier, Jean-Gabriel & Lin, Liyuan & Wang, Ruodu, 2023. "Pairwise counter-monotonicity," Insurance: Mathematics and Economics, Elsevier, vol. 111(C), pages 279-287.
    6. Christofides, Tasos C. & Vaggelatou, Eutichia, 2004. "A connection between supermodular ordering and positive/negative association," Journal of Multivariate Analysis, Elsevier, vol. 88(1), pages 138-151, January.
    7. Alexander J. McNeil & Rüdiger Frey & Paul Embrechts, 2015. "Quantitative Risk Management: Concepts, Techniques and Tools Revised edition," Economics Books, Princeton University Press, edition 2, number 10496, December.
    8. Alfred Galichon, 2016. "Optimal transport methods in economics," SciencePo Working papers hal-03256830, HAL.
    9. Wang, Bin & Wang, Ruodu, 2011. "The complete mixability and convex minimization problems with monotone marginal densities," Journal of Multivariate Analysis, Elsevier, vol. 102(10), pages 1344-1360, November.
    10. Giovanni Puccetti & Pietro Rigo & Bin Wang & Ruodu Wang, 2019. "Centers of probability measures without the mean," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1482-1501, September.
    11. Alfred Galichon, 2016. "Optimal transport methods in economics," Post-Print hal-03256830, HAL.
    12. Embrechts, Paul & Puccetti, Giovanni & Rüschendorf, Ludger, 2013. "Model uncertainty and VaR aggregation," Journal of Banking & Finance, Elsevier, vol. 37(8), pages 2750-2764.
    13. Bernard, Carole & Jiang, Xiao & Wang, Ruodu, 2014. "Risk aggregation with dependence uncertainty," Insurance: Mathematics and Economics, Elsevier, vol. 54(C), pages 93-108.
    14. Wen-Lian Hsu, 1984. "Approximation Algorithms for the Assembly Line Crew Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 376-383, August.
    15. Alfred Galichon, 2016. "Optimal transport methods in economics," Sciences Po Economics Publications (main) hal-03256830, HAL.
    16. Job Boerma & Aleh Tsyvinski & Alexander P. Zimin, 2021. "Sorting with Team Formation," NBER Working Papers 29290, National Bureau of Economic Research, Inc.
    17. Gilboa, Itzhak & Schmeidler, David, 1989. "Maxmin expected utility with non-unique prior," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 141-153, April.
    18. Yugu Xiao & Jing Yao, 2020. "A note on joint mix random vectors," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(12), pages 3063-3072, June.
    19. Carole Bernard & Oleg Bondarenko & Steven Vanduffel, 2018. "Rearrangement algorithm and maximum entropy," Annals of Operations Research, Springer, vol. 261(1), pages 107-134, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peng Liu & Yang Liu & Houhan Teng, 2025. "Extended Convolution Bounds on the Fr\'{e}chet Problem: Robust Risk Aggregation and Risk Sharing," Papers 2511.21929, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Takaaki Koike & Liyuan Lin & Ruodu Wang, 2022. "Joint mixability and notions of negative dependence," Papers 2204.11438, arXiv.org, revised Jan 2024.
    2. Haiyan Liu & Bin Wang & Ruodu Wang & Sheng Chao Zhuang, 2023. "Distorted optimal transport," Papers 2308.11238, arXiv.org, revised May 2025.
    3. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2020. "Convolution Bounds on Quantile Aggregation," Papers 2007.09320, arXiv.org, revised Sep 2024.
    4. Peng Liu & Yang Liu & Houhan Teng, 2025. "Extended Convolution Bounds on the Fr\'{e}chet Problem: Robust Risk Aggregation and Risk Sharing," Papers 2511.21929, arXiv.org.
    5. Jose Blanchet & Henry Lam & Yang Liu & Ruodu Wang, 2025. "Convolution Bounds on Quantile Aggregation," Operations Research, INFORMS, vol. 73(5), pages 2761-2781, September.
    6. Lauzier, Jean-Gabriel & Lin, Liyuan & Wang, Ruodu, 2023. "Pairwise counter-monotonicity," Insurance: Mathematics and Economics, Elsevier, vol. 111(C), pages 279-287.
    7. Ruodu Wang & Zuo Quan Xu & Xun Yu Zhou, 2019. "Dual utilities on risk aggregation under dependence uncertainty," Finance and Stochastics, Springer, vol. 23(4), pages 1025-1048, October.
    8. Principi, Giulio & Wakker, Peter P. & Wang, Ruodu, 2025. "Anticomonotonicity for preference axioms: The natural counterpart to comonotonicity," Theoretical Economics, Econometric Society, vol. 20(3), July.
    9. Hofert Marius & Memartoluie Amir & Saunders David & Wirjanto Tony, 2017. "Improved algorithms for computing worst Value-at-Risk," Statistics & Risk Modeling, De Gruyter, vol. 34(1-2), pages 13-31, June.
    10. Giovanni Puccetti & Pietro Rigo & Bin Wang & Ruodu Wang, 2019. "Centers of probability measures without the mean," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1482-1501, September.
    11. Carole Bernard & Jinghui Chen & Ludger Rüschendorf & Steven Vanduffel, 2026. "Improved block rearrangement algorithm," Annals of Operations Research, Springer, vol. 357(1), pages 605-632, February.
    12. Carole Bernard & Don McLeish, 2016. "Algorithms for Finding Copulas Minimizing Convex Functions of Sums," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-26, October.
    13. Jean-Gabriel Lauzier & Liyuan Lin & Ruodu Wang, 2023. "Pairwise counter-monotonicity," Papers 2302.11701, arXiv.org, revised May 2023.
    14. Carole Bernard & Ludger Rüschendorf & Steven Vanduffel & Ruodu Wang, 2017. "Risk bounds for factor models," Finance and Stochastics, Springer, vol. 21(3), pages 631-659, July.
    15. Jakub Ryłow, 2026. "Topological Methods in Economics: From Equilibrium Existence to Topological Data Analysis," Working Papers 2026-9, Faculty of Economic Sciences, University of Warsaw.
    16. Susanne Schennach & Vincent Starck, 2026. "Optimally‐Transported Generalized Method of Moments," Econometrica, Econometric Society, vol. 94(2), pages 619-640, March.
    17. Mario Ghossoub & Jesse Hall & David Saunders, 2023. "Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 1158-1182, May.
    18. Itai Arieli & Yakov Babichenko & Fedor Sandomirskiy, 2023. "Feasible Conditional Belief Distributions," Papers 2307.07672, arXiv.org, revised Nov 2024.
    19. Beatrice Acciaio & Berenice Anne Neumann, 2025. "Characterization of transport optimizers via graphs and applications to Stackelberg–Cournot–Nash equilibria," Mathematics and Financial Economics, Springer, volume 19, number 3, June.
    20. Louis Chen & Will Ma & Karthik Natarajan & David Simchi-Levi & Zhenzhen Yan, 2022. "Distributionally Robust Linear and Discrete Optimization with Marginals," Operations Research, INFORMS, vol. 70(3), pages 1822-1834, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:49:y:2024:i:4:p:2786-2802. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.