[et_pb_section fb_built=”1″ make_equal=”on” use_custom_gutter=”on” gutter_width=”1″ specialty=”on” background_color_2=”gcid-e428b4a0-8f75-478b-bc91-d4c919946667″ padding_top_1=”0px” padding_top_2=”20px” padding_right_1=”0px” padding_right_2=”15px” padding_bottom_1=”0px” padding_bottom_2=”40px” padding_left_1=”0px” padding_left_2=”15px” padding_top_bottom_link_1=”false” padding_top_bottom_link_2=”false” padding_left_right_link_1=”false” padding_left_right_link_2=”false” _builder_version=”4.25.2″ _module_preset=”default” width=”100%” max_width=”100%” inner_width=”100%” inner_max_width=”100%” custom_margin=”0px|0px|0px|0px|false|false” custom_padding=”0px|0px|0px|0px|false|false” border_width_top=”7px” border_color_top=”gcid-e428b4a0-8f75-478b-bc91-d4c919946667″ locked=”off” global_colors_info=”{%22gcid-e428b4a0-8f75-478b-bc91-d4c919946667%22:%91%22border_color_top%22,%22background_color_2%22%93}”][et_pb_column type=”3_4″ specialty_columns=”3″ _builder_version=”4.16″ custom_padding=”|||” global_colors_info=”{}” custom_padding__hover=”|||”][et_pb_row_inner use_custom_gutter=”on” gutter_width=”1″ make_equal=”on” _builder_version=”4.25.2″ _module_preset=”default” width=”100%” max_width=”100%” custom_margin=”0px|0px|0px|0px|false|false” custom_padding=”40px|40px|10px|40px|false|false” global_colors_info=”{}”][et_pb_column_inner saved_specialty_column_type=”3_4″ _builder_version=”4.25.2″ _module_preset=”default” custom_padding=”0px|0px|0px|0px|false|false” global_colors_info=”{}”][et_pb_heading title=”Combinatorial Game Theory Colloquium III” _builder_version=”4.25.2″ _module_preset=”default” title_text_color=”#f29062″ title_font_size=”22px” global_colors_info=”{}”][\/et_pb_heading][et_pb_heading title=”(Lisbon, 22-24 January, 2019)” _builder_version=”4.25.0″ _module_preset=”default” title_level=”h6″ custom_margin=”-5px||||false|false” custom_padding=”0px||||false|false” locked=”off” global_colors_info=”{}”][\/et_pb_heading][et_pb_text _builder_version=”4.27.3″ _module_preset=”default” custom_margin=”20px||||false|false” global_colors_info=”{}”]<\/p>\n
Combinatorial Game Theory<\/strong>\u00a0(CGT) is a branch\u00a0of mathematics that studies\u00a0sequential games\u00a0with perfect information<\/strong>. Combinatorial games\u00a0include well-known rulesets like Amazons,\u00a0Clobber, Domineering, Hackenbush, Konane,\u00a0Nim, Octal Games, Wythoff\u2019s Nim.\u00a0After John Conway’s\u00a0On Numbers and Games\u00a0<\/em>(1976), Elwyn Berlekamp, John Conway, and Richard Guy published \u201cthe book\u201d\u00a0Winning Ways\u00a0<\/em>(1982).\u00a0In\u00a0that\u00a0work,\u00a0one can\u00a0find a unified\u00a0mathematical\u00a0theory able to analyze a large class of rulesets. The books\u00a0Lessons in Play<\/em>\u00a0(2007), by Michael Albert, David Wolfe, and Richard Nowakowski, and\u00a0Combinatorial Game Theory<\/em>\u00a0(2013), by Aaron Siegel, are also mandatory reading.<\/strong><\/span> Combinatorial Game Theory Colloquia<\/strong><\/b>\u00a0are held every\u00a0<\/span><\/span>two years<\/span><\/span>, in Portugal.\u00a0Associa\u00e7\u00e3o Ludus\u00a0will organize\u00a0<\/span><\/span>in Lisbon<\/strong><\/b>\u00a0<\/span>the\u00a0third edition of the CGTC,\u00a0<\/span>22-24 January, 2019<\/strong><\/b>, with support of\u00a0Centro de An\u00e1lise Funcional, Estruturas Lineares e Aplica\u00e7\u00f5es, Centro de Matem\u00e1tica Aplicada \u00e0 Previs\u00e3o e Decis\u00e3o Econ\u00f3mica,\u00a0<\/span>Centro Interuniversit\u00e1rio de Hist\u00f3ria das Ci\u00eancias e da Tecnologia, and Biosystems and Integrative Sciences Institute.\u00a0<\/span>The Colloquium will be\u00a0<\/span>hosted by Centro de Matem\u00e1tica Aplicada \u00e0 Previs\u00e3o e Decis\u00e3o Econ\u00f3mica<\/strong><\/b>\u00a0<\/span>(for a map of its location\u00a0<\/span>press\u00a0<\/span>here<\/a><\/span><\/span>).<\/span><\/strong><\/p>\n [\/et_pb_text][et_pb_image src=”https:\/\/ludicum.org\/wp-content\/uploads\/2024\/11\/cgtciii_poster.jpg” _builder_version=”4.27.3″ _module_preset=”default” title_text=”cgtciii_poster” align=”center” custom_margin=”50px||50px||false|false” hover_enabled=”0″ sticky_enabled=”0″ max_width=”70%” max_width_last_edited=”on|phone” max_width_phone=”90%” max_width_tablet=”70%”][\/et_pb_image][et_pb_text _builder_version=”4.27.3″ _module_preset=”default” custom_margin=”20px||||false|false” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n For informations about submissions and registrations, just mail us:\u00a0<\/span>cgtc@cgtc.eu<\/a><\/span><\/strong><\/p>\n Authors of significant original results related to (presented at) the conference are encouraged to submit them by\u00a0September 1<\/span><\/span><\/b><\/span>, 2019<\/strong>\u00a0<\/span>to the\u00a0<\/span>International Journal of Game Theory.<\/a>\u00a0<\/span>The papers will be refereed according to the normal high journal standards. Those articles that are accepted will be published together in a single issue of IJGT.<\/span><\/span> <\/span><\/strong><\/p>\n <\/span><\/strong><\/p>\n \n [\/et_pb_text][et_pb_tabs _builder_version=”4.25.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_tab title=”Organization” _builder_version=”4.24.3″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Alda Carvalho<\/strong>, ISEL & CEMAPRE<\/span> Alda Carvalho<\/strong>, ISEL & CEMAPRE<\/span> [\/et_pb_tab][et_pb_tab title=”Program” _builder_version=”4.25.0″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Standard Talks, Mornings – AUDIT\u00d3RIO 2, Quelhas List of Participants<\/strong>:Adam Atkinson, Alda Carvalho, Alexandre Silva, Annamaria Cucinotta, Antoine Dailly, Bernhard von Stengel, Carlos Pereira dos Santos, C\u00e1tia Lente, Fionn Mc inerney, Hironori Kiya, Jo\u00e3o Pedro Neto, Jorge Nuno Silva, Karim Soliman, Koki Suetsugu, Kyle Burke, Marc Heinrich, Matthieu Dufour, Matthew Ferland, Melissa Huggan, Michael Fisher, Ravi Kant Rai, Richard Nowakowski, Svenja Huntemann, Thane Plambeck, Tiago Hirth, Tomoaki Abuku, Urban Larsson,Valentin Gledel, and\u00a0Yuki Irie.<\/p>\n <\/span><\/p>\n Richard Nowakowski, <\/span><\/p>\n 9:00-9:30<\/p>\n <\/p>\n<\/td>\n <\/p>\n<\/td>\n Tomoaki Abuku, <\/p>\n<\/td>\n<\/tr>\n <\/span><\/p>\n 10:00-10:30<\/p>\n<\/td>\n <\/p>\n<\/td>\n Bernhard von Stengel, <\/p>\n<\/td>\n <\/p>\n<\/td>\n <\/span> <\/p>\n<\/td>\n Melissa Huggan, <\/p>\n [\/et_pb_tab][et_pb_tab title=”Abstracts” _builder_version=”4.25.0″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Alda Carvalho<\/strong>,\u00a0ISEL & CEMAPRE-UL, Portugal<\/span><\/p>\n Abstract:\u00a0<\/strong>JENGA is a game of physical skill played with 54 wooden blocks. Each block is three times longer than its width. Players move in JENGA by taking one block from any level (except the one below an incomplete top level), and placing it on the topmost level.\u00a0 The winner is the player who makes the last move (usually, before the tower’s collapse). Assuming perfect players, JENGA may be seen as a pure impartial combinatorial ruleset. Therefore, we can analyze it using the standard CGT approach. That is the main issue of this talk. <\/span>(Joint work with Carlos Pereira dos Santos and Jo\u00e3o Pedro Neto)<\/span><\/p>\n <\/span><\/p>\n Antoine Dailly<\/strong>,\u00a0G-SCOP, University of Grenoble, France<\/span><\/b><\/p>\n Abstract:\u00a0<\/strong>We study a generalization of the subtraction games on graphs, in which the players alternate removing connected components from a graph without disconnecting it, and provided the number of vertices in the connected component belongs to a prescribed set of positive integers. We derive general periodicity results for such games, as well as specific results when playing on subdivided stars. Bernhard von Stengel<\/strong>,\u00a0Department of Mathematics, London School of Economics, UK <\/span><\/p>\n Carlos Pereira dos Santos<\/strong>, CEAFEL-UL & ISEL, Portugal<\/span><\/span><\/p>\n Abstract:\u00a0<\/strong>About disjunctive short sum, John Conway wrote the following: The compound game ends as soon as any one of the component games has ended (ONAG, 1976). In fact, this rule is directly related to the idea of terminal moves: moves that imply the end of the play, even if the players still have available options. The end of a component, the capture of a piece (e.g., chess king), a specific goal, are examples of terminal rules related to terminal moves. The game values of terminal moves should be infnite. It is necessary to consider the extended game line in exactly the same way we can consider the extended real number line (with infinities). But an understanding of the algebra is mandatory (game comparison, disjunctive sum, inverses). Success in this task will allow better research on disjunctive short sum of classic Combinatorial Game Theory (e.g., ATARI GO), and better approaches for scoring combinatorial rulesets (e.g. DOTS & BOXES). We will discuss and exemplify some problems behind this idea.<\/span> Fionn Mc Inerney<\/strong>, Universit\u00e9 C\u00f4te D’Azur, France<\/span><\/p>\n<\/div>\n <\/strong><\/p>\n Abstract:\u00a0<\/strong>We introduce the ORTHOGONAL COLOURING GAME, in which two players alternately colour vertices (from a choice of m colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. Each player aims to maximize her score, which is the number of coloured vertices in the copy of the graph she owns. It is proven that, given an instance, the normal play convention of this game is PSPACE-complete and a reduction from the colouring construction game to the scoring version of the ORTHOGONAL COLOURING GAME is given which provides a nice connection between the two. The main result of this paper is that the second player has a strategy to force a draw in this game for any m for graphs that admit a strictly matched involution. This property is defined and then a characterization\u00a0 of the graphs which have it is given which also gives an explicit construction for these graphs. Examples of such graphs are the graphs associated with Latin squares and sudoku squares.<\/p>\n Hironori Kiya<\/strong>, Nagoya University, Japan<\/span><\/p>\n Abstract:\u00a0<\/strong>TANHINMIN is a card-based partisan game with a totally ordered set of cards. Players in turn discard a card that must be greater than the lastly discarded card, and the player that first discards all the cards in hand is the winner. We consider a 2-player generalized TANHINMIN,\u00a0 where the size of the deck is arbitrary. We also consider a 2-player generalized TANHINMIN with extra rules. For both, we show that the winner can be decided in polynomial time.<\/span><\/p>\n <\/a><\/span><\/p>\n Koki Suetsugu<\/strong>, Kyoto University, Japan<\/span><\/span><\/p>\n Abstract:\u00a0<\/strong>Cyclic NIMHOFF is a variant of Wythoff NIM. In this game, there are some heaps and each player can move as following:<\/span><\/p>\n (i) Choose one heap and remove any number of stones. Fraenkel and Lorberbom found a formula to obtain the Sprague-Grundy values of the positions of this game in 1991. (i) is the same move as NIM and in this talk, we replace (i) with the move of other games like subtraction NIM or all-but NIM. We include the case that replaced rules are different for each heap. Marc Heinrich,\u00a0<\/strong>LIRIS, University of Lyon, France<\/span><\/p>\n Abstract:\u00a0<\/strong>Subtraction games are combinatorial games played with one heap of tokens where each player can remove a number\u00a0s<\/em>\u00a0of tokens, where\u00a0s<\/em>\u00a0is taken in some fixed set\u00a0S<\/em>. We study a partizan version of these games where each player has a different set. We are interested in the asymptotic behavior of the outcome sequence when the number of tokens is large.
<\/strong><\/span><\/p>\nREGISTRATION<\/h5>\n
CALL FOR PAPERS<\/span><\/strong><\/h5>\n
<\/span>As\u00a0author comment<\/strong>, please include the line \u201cWe are submitting this article to be considered\u00a0for<\/span>\u00a0the issue related to the Combinatorial Game Theory Colloquium 3 (CGTC3) held in Lisbon in January 2019.\u201d.<\/span>
<\/span><\/span>Urban<\/span>\u00a0Larsson AE IJGT, Carlos Pereira dos Santos, Richard Nowakowski\u00a0<\/span><\/p>\nScientific Committee<\/h3>\n
Aviezri S. Fraenkel<\/a>, Weizmann Institute of Science<\/span>
Bernhard von Stengel<\/a>, London School of Economics and Political Science<\/span>
Carlos Pereira dos Santos<\/a>, LA & CEAFEL-University of Lisbon<\/span>
Eric Duchene<\/a>, IUT Lyon 1, LIRIS lab.<\/span>
Gabriel Renault<\/a>, Sopra Steria<\/span>
Jo\u00e3o Pedro Neto<\/a>, University of Lisbon<\/span>
Jorge Nuno Silva<\/a>, University of Lisbon<\/span>
Martin Mueller<\/a>, University of Alberta\u00a0<\/span>
Pedro J. Freitas<\/a>, CEAFEL-University of Lisbon<\/span>
Richard Nowakowski<\/a>, Dalhousie University<\/span>
Thane Plambeck<\/strong>, Counterwave, Inc<\/span>
Urban Larsson<\/a>, Industrial Engineering and Management, Technion<\/span><\/p>\n<\/ul>\n
Organizing Committee<\/h3>\n
Anabela Teixeira<\/a>, LA, MUHNAC & UIDEF-University of Lisbon<\/span>
Carlos Pereira dos Santos<\/a>, LA & CEAFEL-University of Lisbon<\/span>
Jorge Nuno Silva<\/a>, CIUHCT-University of Lisbon<\/span>
Pedro J. Freitas<\/a>, CEAFEL-University of Lisbon<\/span>
Tiago Hirth<\/strong>, LA<\/span>
Tiago Robalo<\/a>, LA<\/span><\/p>\n
<\/b>
Working Sessions, Afternoons (14:00-18:00): Rooms –\u00a0CTT, DELTA, IAPMEI, 306<\/strong><\/p>\n\n\n
\n <\/td>\n 22\/1 – Tuesday<\/td>\n 23\/1 – Wednesday<\/td>\n 24\/1 – Thursday<\/td>\n<\/tr>\n \n \u00a08:30-8:45<\/td>\n Opening ceremony<\/td>\n <\/td>\n <\/td>\n<\/tr>\n \n 8:45-9:00<\/td>\n \n
Dalhousie University,<\/span>
\u00a0\u00a0\u00a0 Trends in Combinatorial Game Theory<\/span><\/p>\n<\/td>\n<\/td>\n <\/td>\n<\/tr>\n \n \n \n
Yuki Irie,
Tohoku University,
p-Saturations of Welter’s game and the<\/span>
irreducible representations of symmetric groups<\/span><\/span><\/p>\n\n
University of Tsukuba,
On NIM-like games played on graphs<\/span><\/span><\/p>\n\n \u00a09:30-10:00<\/td>\n Antoine Dailly,
University of Grenoble,
Connected subtraction games on graphs<\/td>\nThane Plambeck,
Counterwave inc,
Shotgun\u00a0wedding:\u00a0 ECGT\u00a0+ CGT<\/td>\nSvenja Huntemann,
Carleton University<\/span>,
<\/span>\u00a0\u00a0\u00a0 Enumerating DOMINEERING<\/span>
<\/span><\/td>\n<\/tr>\n\n \n \n
<\/strong><\/span>Michael Fisher,<\/span>
West Chester University,<\/span>
\u00a0<\/span>Beatty Games: Big and Small<\/span><\/p>\n
Alda Carvalho,<\/span>
ISEL & CEMAPRE-UL,<\/span>
Combinatorics of JENGA<\/span><\/span><\/span><\/td>\nValentin Gledel,
University of Lyon,
The Maker-Breaker domination number \u00a0 \u00a0<\/span><\/td>\n<\/tr>\n\n 10:30-11:00<\/td>\n Coffee-break<\/td>\n Coffee-break<\/td>\n Coffee-break<\/td>\n<\/tr>\n \n 11:00-11:30<\/td>\n Carlos Pereira dos Santos,
CEAFEL-UL & ISEL,
Extended Combinatorial Game Theory:
the effect of the terminal move<\/td>\nKoki Suetsugu,
Kyoto University,
Dependent sum game:
Some variants of Wythoff NIM and Ryuo NIM<\/td>\nRavi Kant Rai,<\/span>
Indian Institute of Technology Bombay,<\/span>
Optimal play in DUIDOKU game<\/span><\/td>\n<\/tr>\n\n 11:30-12:00<\/td>\n Marc Heinrich,
<\/strong>University of Lyon,
Partizan subtraction games<\/td>\nFionn Mc Inerney,
Universit\u00e9 C\u00f4te D’Azur,
The\u00a0ORTHOGONAL COLOURING GAME
on graphs<\/td>\nHironori Kiya,
Nagoya University,
Two player TANHINMIN
and its extension<\/td>\n<\/tr>\n\n 12:00-12:30<\/td>\n \n
London School of Economics<\/span>,
\u00a0\u00a0\u00a0 Computational progress on the Catch-Up game<\/span><\/span><\/p>\n\n
Urban Larsson,
Technion\u00a0–\u00a0Institute of Technology,
Efficiency of cumulative subtraction games
as extensive form games<\/span><\/span><\/p>\nMatthew Ferland,
University of Southern California,
<\/span>Computational Properties of SLIMETRAIL<\/td>\n<\/tr>\n\n 12:30-13:00<\/td>\n \n
<\/span><\/p>\n\n
Dalhousie University,<\/p>\n<\/td>\n<\/tr>\n \n 13:00-14:00<\/td>\n Break for lunch<\/td>\n Break for lunch<\/td>\n Break for lunch<\/td>\n<\/tr>\n \n 14:00-18:00<\/td>\n Working sessions<\/td>\n Working sessions<\/td>\n Working sessions<\/td>\n<\/tr>\n \n \u00a019.00-23:00<\/td>\n <\/td>\n Conference Dinner<\/td>\n <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n Combinatorics of JENGA<\/span><\/h5>\n
Connected subtraction games on graphs<\/span><\/h5>\n
(Joint work with\u00a0Julien Moncel and Aline Parreau)<\/span><\/p>\nComputational progress on the Catch-Up game<\/span><\/h5>\n
<\/span><\/p>\nExtended Combinatorial Game Theory: the effect of the terminal move<\/span><\/h6>\n
(Joint work with Richard Nowakowski and Urban Larsson)<\/span><\/p>\nThe\u00a0ORTHOGONAL COLOURING GAME on graphs<\/span><\/h6>\n
<\/span><\/h6>\n
Two player TANHINMIN and its extension<\/span><\/h6>\n
On Wythoff type extension of general subtraction game<\/span><\/h6>\n
(ii) Remove a total of k stones from\u00a0any number of heaps, provided that k<p.<\/p>\n
(Joint work with\u00a0Tomoaki Abuku and Ko Sakai)<\/a><\/a><\/strong><\/span><\/p>\nPartizan subtraction games<\/span><\/h6>\n