<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-242</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>ОПРЕДЕЛЕНИЕ ЦЕНЫ ЛИМИТНОГО ОРДЕРА С ВЫСОКОЙ ВЕРОЯТНОСТЬЮ ИСПОЛНЕНИЯ</article-title><trans-title-group xml:lang="en"><trans-title>PRICE ESTIMATION OF LIMIT ORDER WITH HIGH EXECUTION PROBABILITY</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Морозов</surname><given-names>И. О.</given-names></name><name name-style="western" xml:lang="en"><surname>Morozov</surname><given-names>I. O.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Поттосина</surname><given-names>С. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Pottosina</surname><given-names>S. A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>7</issue><fpage>78</fpage><lpage>83</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Морозов И.О., Поттосина С.А., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Морозов И.О., Поттосина С.А.</copyright-holder><copyright-holder xml:lang="en">Morozov I.O., Pottosina S.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/242">https://doklady.bsuir.by/jour/article/view/242</self-uri><abstract><p>Рассматривается алгоритм определения цены посылаемого на биржу лимитного ордера с фиксированной ценой для повышения вероятности его исполнения и уменьшения рисков, связанных с рыночными ордерами. Метод основан на анализе обработанных сообщений первого уровня, поступающих с цифровых торговых платформ в режиме реального времени. Приведены практические результаты торговли внутри дня.</p></abstract><trans-abstract xml:lang="en"><p>Limit order price estimation algorithm is considered in the article. Algorithm increases execution probability. It is based on the processing of the first level capital market data such as tick trades and quotes. It is shown and proved by practical results that algorithm allows successfully detect price of limit order for good position entry and exit.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>лимитный ордер</kwd><kwd>совершенные сделки</kwd><kwd>спрос</kwd><kwd>предложение</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Lauricella T. // The Wall Street Journal. Archived from the original on 21 October 2010. Retrieved 28 October 2010.</mixed-citation><mixed-citation xml:lang="en">Lauricella T. // The Wall Street Journal. Archived from the original on 21 October 2010. Retrieved 28 October 2010.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Larry Harris.Trading &amp; Exchanges. Oxford, 2003.</mixed-citation><mixed-citation xml:lang="en">Larry Harris.Trading &amp; Exchanges. Oxford, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ross S. M. // Journal of Engineering Technology. New Haven, 2003.</mixed-citation><mixed-citation xml:lang="en">Ross S. M. // Journal of Engineering Technology. New Haven, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Knuth D.E. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Boston, 1998.</mixed-citation><mixed-citation xml:lang="en">Knuth D.E. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Boston, 1998.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
