IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v51y2001i1p47-51.html
   My bibliography  Save this article

A remark on quadrant normal probabilities in high dimensions

Author

Listed:
  • Rinott, Yosef
  • Rotar, Vladimir

Abstract

This paper provides an asymptotic evaluation of the quadrant probability P(Y1[less-than-or-equals, slant]b,...,Yt[less-than-or-equals, slant]b) as t-->[infinity], where the Yi's are exchangeable normals with a correlation [rho]. This probability is often represented as , where [Phi] is the standard normal distribution, and a=(1-[rho])/[rho].

Suggested Citation

  • Rinott, Yosef & Rotar, Vladimir, 2001. "A remark on quadrant normal probabilities in high dimensions," Statistics & Probability Letters, Elsevier, vol. 51(1), pages 47-51, January.
    • Handle: RePEc:eee:stapro:v:51:y:2001:i:1:p:47-51
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(00)00141-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rinott, Yosef & Scarsini, Marco, 2000. "On the Number of Pure Strategy Nash Equilibria in Random Games," Games and Economic Behavior, Elsevier, vol. 33(2), pages 274-293, November.
    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. A. Stepanov, 2007. "The number of records within a random interval of the current record value," Statistical Papers, Springer, vol. 48(1), pages 63-79, January.
    2. E. de Klerk & D.V. Pasechnik & J.P. Warners, 2004. "On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 267-294, September.
    3. de Klerk, E. & Pasechnik, D.V. & Warners, J.P., 2004. "On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function," Other publications TiSEM 7a6fbcee-93d0-4f7d-86be-b, Tilburg University, School of Economics and Management.
    4. Hashorva, Enkelejd, 2002. "Remarks on domination of maxima," Statistics & Probability Letters, Elsevier, vol. 60(1), pages 101-109, November.

    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. Pei, Ting & Takahashi, Satoru, 2019. "Rationalizable strategies in random games," Games and Economic Behavior, Elsevier, vol. 118(C), pages 110-125.
    2. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    3. Ben Amiet & Andrea Collevecchio & Marco Scarsini & Ziwen Zhong, 2021. "Pure Nash Equilibria and Best-Response Dynamics in Random Games," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1552-1572, November.
    4. Collevecchio, Andrea & LiCalzi, Marco, 2012. "The probability of nontrivial common knowledge," Games and Economic Behavior, Elsevier, vol. 76(2), pages 556-570.
    5. Stanford, William, 2010. "The number of pure strategy Nash equilibria in random multi-team games," Economics Letters, Elsevier, vol. 108(3), pages 352-354, September.
    6. Arieli, Itai & Babichenko, Yakov, 2016. "Random extensive form games," Journal of Economic Theory, Elsevier, vol. 166(C), pages 517-535.
    7. Mimun, Hlafo Alfie & Quattropani, Matteo & Scarsini, Marco, 2024. "Best-response dynamics in two-person random games with correlated payoffs," Games and Economic Behavior, Elsevier, vol. 145(C), pages 239-262.
    8. Szabó, György & Borsos, István & Szombati, Edit, 2019. "Games, graphs and Kirchhoff laws," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 416-423.
    9. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Oct 2024.
    10. Torsten Heinrich & Yoojin Jang & Luca Mungo & Marco Pangallo & Alex Scott & Bassel Tarbush & Samuel Wiese, 2021. "Best-response dynamics, playing sequences, and convergence to equilibrium in random games," Papers 2101.04222, arXiv.org, revised Nov 2022.
    11. Pangallo, Marco & Heinrich, Torsten & Jang, Yoojin & Scott, Alex & Tarbush, Bassel & Wiese, Samuel & Mungo, Luca, 2021. "Best-Response Dynamics, Playing Sequences, And Convergence To Equilibrium In Random Games," INET Oxford Working Papers 2021-23, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
    12. Torsten Heinrich & Yoojin Jang & Luca Mungo & Marco Pangallo & Alex Scott & Bassel Tarbush & Samuel Wiese, 2023. "Best-response dynamics, playing sequences, and convergence to equilibrium in random games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 703-735, September.
    13. Andrea Collevecchio & Tuan-Minh Nguyen & Ziwen Zhong, 2024. "Finding pure Nash equilibria in large random games," Papers 2406.09732, arXiv.org, revised Aug 2024.
    14. Ben Amiet & Andrea Collevecchio & Kais Hamza, 2020. "When "Better" is better than "Best"," Papers 2011.00239, arXiv.org.
    15. Andrea Collevecchio & Hlafo Alfie Mimun & Matteo Quattropani & Marco Scarsini, 2024. "Basins of Attraction in Two-Player Random Ordinal Potential Games," Papers 2407.05460, arXiv.org.
    16. Takahashi, Satoru, 2008. "The number of pure Nash equilibria in a random game with nondecreasing best responses," Games and Economic Behavior, Elsevier, vol. 63(1), pages 328-340, May.

    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:eee:stapro:v:51:y:2001:i:1:p:47-51. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.