<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Economics and Mathematical Methods</journal-id><journal-title-group><journal-title xml:lang="en">Economics and Mathematical Methods</journal-title><trans-title-group xml:lang="ru"><trans-title>Экономика и математические методы</trans-title></trans-title-group></journal-title-group><issn publication-format="print">0424-7388</issn><issn publication-format="electronic">3034-6177</issn><publisher><publisher-name xml:lang="en">The Russian Academy of Sciences</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">653318</article-id><article-id pub-id-type="doi">10.31857/S0424738824010111</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Mathematical analysis of economic models</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Математический анализ экономических моделей</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Survival of the strongest in a sequential truel</article-title><trans-title-group xml:lang="ru"><trans-title>Выживание сильнейшего в последовательной труэли</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Ilinskiy</surname><given-names>D. G.</given-names></name><name xml:lang="ru"><surname>Ильинский</surname><given-names>Д. Г.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>nograhol@gmail.com</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Izmalkov</surname><given-names>S. B.</given-names></name><name xml:lang="ru"><surname>Измалков</surname><given-names>С. Б.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>sizmalkov@nes.ru</email><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Savvateev</surname><given-names>A. V.</given-names></name><name xml:lang="ru"><surname>Савватеев</surname><given-names>А. В.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>hibiny@mail.ru</email><xref ref-type="aff" rid="aff4"/><xref ref-type="aff" rid="aff5"/><xref ref-type="aff" rid="aff6"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Central Economics and Mathematics Institute RAS</institution></aff><aff><institution xml:lang="ru">ЦЭМИ РАН</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Institute of Physics and Technology</institution></aff><aff><institution xml:lang="ru">Московский физико-технический институт</institution></aff></aff-alternatives><aff-alternatives id="aff3"><aff><institution xml:lang="en">New Economic School</institution></aff><aff><institution xml:lang="ru">РЭШ</institution></aff></aff-alternatives><aff-alternatives id="aff4"><aff><institution xml:lang="en">Caucasus Mathematical Center, Adyghe State University</institution></aff><aff><institution xml:lang="ru">Кавказский математический центр АГУ</institution></aff></aff-alternatives><aff-alternatives id="aff5"><aff><institution xml:lang="en">Moscow Institute of Physics and Technology</institution></aff><aff><institution xml:lang="ru">Московский физико-технический институт</institution></aff></aff-alternatives><aff-alternatives id="aff6"><aff><institution xml:lang="en">Central Economics and Mathematics Institute, RAS</institution></aff><aff><institution xml:lang="ru">ЦЭМИ РАН</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-07-03" publication-format="electronic"><day>03</day><month>07</month><year>2024</year></pub-date><volume>60</volume><issue>1</issue><fpage>133</fpage><lpage>140</lpage><history><date date-type="received" iso-8601-date="2025-02-03"><day>03</day><month>02</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Russian Academy of Sciences</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Российская академия наук</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Russian Academy of Sciences</copyright-holder><copyright-holder xml:lang="ru">Российская академия наук</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/0424-7388/article/view/653318">https://journals.eco-vector.com/0424-7388/article/view/653318</self-uri><abstract xml:lang="en"><p>Sequential truel is a duel-like game between three players. Each players is endowed with his own marksmanship. At each turn, a player whose turn is to shoot can target any of the remaining alive opponents or abstain from shooting. The game ends when there is only one player alive or when all alive players abstained from shooting one after another. The single survivor obtains the “survivor” prize 1, while the payoff of all other players is 0. In the case the truel ends due to “inactivity”, all the players receive the payoff of 0. It is a deeply studied game with paradoxical finding that the weakest player has the highest probability of surviving in many settings, especially when the player can abstain from shooting. Here we present an explicit construction that contradicts this finding. There exists a mixed strategy subgame perfect equilibrium in which the strongest player has the highest probability of survival. This equilibrium exists for a specific order of play, in which the two stronger opponents act before the weakest one. When it exists, there are multiple subgame-perfect equilibria, including the existing stationary construction, in which two stronger opponents target each other.</p></abstract><trans-abstract xml:lang="ru"><p>Последовательная труэль — один из видов дуэли для трех игроков. У каждого игрока — свой уровень меткости. Игроки ходят по очереди, в каждом раунде выбирая в качестве цели одного из оставшихся в живых игроков или — уклоняясь от стрельбы. Игра заканчивается, когда в живых остается только один игрок, или — при трех последовательных уклонениях от стрельбы. Единственный выживший получает выигрыш победителя, равный 1, а остальные получают 0. В случае когда дуэль заканчивается «мирным» способом, все игроки получают выигрыш, равный 0. Эта игра изучена достаточно хорошо, и большинство исследований посвящено парадоксальному выводу о том, что самый слабый игрок имеет наибольшую вероятность выживания во многих условиях, особенно когда у игроков есть возможность уклониться от стрельбы. В данной статье мы представляем конструкцию равновесия, которое опровергает данный вывод. А именно: существует смешанное равновесие, совершенное на подыграх, в котором сильнейший игрок имеет наибольшую вероятность выжить. Данное равновесие существует при определенном порядке игроков, в котором двое сильнейших стреляют перед слабейшим. Если оно существует, то имеется набор равновесий, совершенных на подыграх, включая стационарное, в котором двое сильнейших стреляют друг в друга.</p></trans-abstract><kwd-group xml:lang="en"><kwd>sequential truel</kwd><kwd>subgame perfect equilibrium</kwd><kwd>survival of the weakest</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>последовательная труэль</kwd><kwd>совершенное на подыграх равновесие</kwd><kwd>выживание слабейшего</kwd></kwd-group><funding-group><award-group><funding-source><institution-wrap><institution xml:lang="en">Basic Research for financial support (project)</institution></institution-wrap><institution-wrap><institution xml:lang="ru">Российский фонд фундаментальных исследований (проект)</institution></institution-wrap></funding-source><award-id>20-010-00569-А</award-id></award-group></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Amengual P., Toral R. (2006). Truels, or the survival of the weakest. Computing in Science and Engineering, 8 (5), 88–95.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Archetti M. (2012). Survival of the weakest in n-person duels and the maintenance of variation under constant selection. Evolution: International Journal of Organic Evolution, 66 (3), 637–650.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Bossert W., Brams S. J., Kilgour D. M. (2002). Cooperative vs non-cooperative truels: Little agreement, but does that matter? Games and Economic Behavior, 40 (2), 185–202.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Cole S. G., Phillips J. L., Hartman E. A. (1977). Test of a model of decision processes in an intense conflict situation. Behavioral Science, 22 (3), 186–196.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Dubovik A., Parakhonyak A. (2014). Drugs, guns, and targeted competition. Games and Economic Behavior, 87, 497–507.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Gardner M. (1966). More mathematical puzzles and diversions. London: Penguin.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Kilgour D. M. (1972). The simultaneous truel. International Journal of Game Theory, 1 (5), 229–242.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Kilgour D. M. (1975). The sequential truel. International Journal of Game Theory, 4 (3), 151–174.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Kilgour D. M. (1978). Equilibrium points of infinite sequential truels. International Journal of Game Theory, 6 (3), 167–180.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Kilgour D. M., Brams S. J. (1997). The truel. Mathematics Magazine, 70 (5), 315–326.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Kinnaird C. (1946). Encyclopedia of puzzles and pastimes. N.Y.: Citadel Press.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Mosteller F. (1987). Fifty challenging problems in probability with solutions. Reading: Addison-Wesley Publishing Co.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Phillips H. (1937). Question time: An omnibus of problems for a brainy day. London: J. M. Dent &amp; Sons.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Richman J. T. (2020). Victory by the weakest: Effects of negative advertising in N &gt; 2 candidate campaigns. Virginia Social Science Journal, 54, 30–39.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Shubik M. (1954). Readings in game theory and related behavior. Chapter: Does the fittest necessarily survive? N.Y.: Doubleday, Garden City.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Shubik M. (1964). Game theory and related approaches to social behavior selections. N.Y.: John Wiley &amp; Sons.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Skaperdas S., Grofman B. (1995). Modeling negative campaigning. American Political Science Review, 89 (1), 49–61.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Toral R., Amengual P. (2005). Distribution of winners in truel games. In: AIP Conference Proceedings, 779, 128–141. College Park (MD): American Institute of Physics.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Wegener M., Mutlu E. (2021). The good, the bad, the well-connected. International Journal of Game Theory, 50 (3), 759–771.</mixed-citation></ref></ref-list></back></article>
