Combinatorial Game Theory Colloquia <\/strong>are held every two years<\/span>, in Portugal. Associa\u00e7\u00e3o Ludus will organize in Lisbon<\/strong> the second edition of the CGTC, 25-27 January, 2017<\/strong>, with support of Centro de An\u00e1lise Funcional, Estruturas Lineares e Aplica\u00e7\u00f5es, Centro de Matem\u00e1tica Aplicada \u00e0 Previs\u00e3o e Decis\u00e3o Econ\u00f3mica, Centro Interuniversit\u00e1rio de Hist\u00f3ria das Ci\u00eancias e da Tecnologia, and Laborat\u00f3rio de Modela\u00e7\u00e3o e Agentes<\/span>. The Colloquium will be hosted by the Faculty of Sciences, University of Lisbon <\/strong>(for a map of its location press\u00a0here<\/span><\/a>).<\/span><\/strong><\/p>\n <\/strong><\/p>\n Standard Talks, Mornings (8:00-13:00) – BuildingC6, Room 6.2.56 [\/et_pb_text][et_pb_image src=”https:\/\/ludicum.org\/wp-content\/uploads\/2024\/11\/cgtciiposter.jpg” _builder_version=”4.27.3″ _module_preset=”default” title_text=”cgtciiposter” align=”center” max_width_last_edited=”on|phone” max_width=”70%” custom_padding=”40px||40px||false|false” hover_enabled=”0″ sticky_enabled=”0″ 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: <\/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>, 2017<\/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> [\/et_pb_text][et_pb_tabs _builder_version=”4.25.2″ _module_preset=”default” custom_margin=”20px||||false|false” global_colors_info=”{}”][et_pb_tab title=”Organization” _builder_version=”4.25.0″ _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 <\/span>Standard Talks, Mornings (8:00-13:00) – Building\u00a0C6, Room 6.2.56\u00a0<\/span><\/strong><\/p>\n Working Sessions, Afternoons (14:00-18:00) – Building\u00a0C8, Rooms 8.2.11,\u00a08.2.13,\u00a08.2.17,\u00a08.2.19 [\/et_pb_tab][et_pb_tab title=”Abstracts and Slides” _builder_version=”4.25.0″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n Carlos Pereira dos Santos<\/strong>, CEAFEL, University of Lisbon<\/span><\/span><\/p>\n <\/span><\/a><\/strong><\/span><\/a><\/strong>Abstract:\u00a0<\/span><\/strong>Regarding short Conway\u2019s group, a value of a game can be thought of as an indeterminate cloud, covering the confusion interval. In such a situation it is natural to ask \u2013\u00a0<\/span>Is there a fair settlement about the value of a game?<\/em>\u00a0<\/span>The answer is well-known; it is the mean value\u00a0<\/span>m(G)\u00a0<\/span><\/em>(a number), satisfying<\/p>\n \u00a0<\/span>n.m(G)-t<\/em>\u00a0\u2264\u00a0<\/span>n.G<\/em>\u00a0\u2264\u00a0<\/span>n.m(G)+t<\/em>\u00a0<\/span>(for some fixed perturbation\u00a0<\/span>t<\/em>).<\/p>\n In this work, we discuss the occurrence of a mean value in the guaranteed scoring universe which is, in some sense, two-dimensional due the different nature of moves and points.<\/span><\/a><\/strong><\/p>\n<\/div>\n (joint work with Richard Nowakowski and Urban Larsson)<\/p>\n Download<\/a><\/p>\n Israel Rocha<\/strong>, Dalhousie University Abstract:\u00a0<\/span><\/span><\/a><\/strong><\/span><\/a><\/strong>Picaria is a traditional board game, played by the Zuni tribe of the\u00a0<\/span><\/span><\/a><\/strong>American Southwest and other parts of the world, such as a rural Southwest\u00a0<\/span><\/strong>region in Sweden. It is related to the popular children’s game of Tic-tac-toe,\u00a0<\/span><\/strong>but the 2 players have only 3 stones each, and in the second phase of the game, pieces are slided, along speci_ed move edges, in attempts to create the three-in-a-row. We provide a rigorous solution, and prove that the game is a draw; moreover our solution gives insights to strategies that players can use.<\/span> Download<\/a><\/p>\n Gabriel Renault<\/strong>, Sopra Steria Abstract:\u00a0<\/strong>IlluNIMati is a partizan variant of NIM in which tokens are triangles with a blue vertex, a green vertex and a red vertex. Only Left may play in a heap where the vertex facing North of the top triangle is blue. Only Right may play in a heap where the vertex facing North of the top triangle is red. They may both play in a heap where the vertex facing North of the top triangle is green. However, after removing any positive number of triangles of a heap, they may turn this heap, choosing which vertex faces North. We consider illuNIMati positions within a bigger set of games, called boomerang games, to solve the mis\u00e8re version.<\/span><\/p>\n Download<\/a><\/span><\/p>\n <\/span><\/p>\n Craig Tennenhouse<\/strong>, University of New England Abstract:<\/strong>\u00a0Blocking Pebbles is a partizan game based on graph pebbling directed acyclic graphs. We demonstrate some results on oriented trees, and find numbers, nimbers, and some infinitesimals on the out-star. Download<\/a><\/span><\/p>\n R. J. Nowakowski<\/strong>, Dalhousie University Abstract:\u00a0<\/strong>A cricket Pitch is a path with bumps (non-negative weights) and a roller that resides at the vertices. Left rolls (one or more edges) to the left and Right to the right reducing each bump by 1. The roller cannot go over a 0-edge, this part is `perfect’. Nowakowski and Ottaway partially solved the game. Nowakowski and (Angela) Siegel give a complete solution in terms of reductions and ordinal sums. Download<\/a><\/span><\/span><\/p>\n Paul Ottaway<\/strong>, Capilano University Abstract:\u00a0<\/strong>Hives is a one-sided loopy (OSLO) game played on a graph with white and red vertices.\u00a0 On Right’s turn, they may colour any white vertex red as long as the set of red vertices form an independent set.\u00a0 On Left’s turn, they may swap the colour of any two adjacent vertices as long as the red vertices remain an independent set.\u00a0 Note that Left has the equivalent of a pass move by selecting a pair of adjacent white vertices while Right does not have a pass move. The game ends when the red vertices form a maximal independent set.\u00a0 In this talk, we will examine the game values and algebraic structure that exists in Hives, provide strategies for certain classes of graphs as well as decomposition theorems for general graphs.<\/span><\/p>\n Download<\/a><\/span><\/p>\n Michael Fisher<\/strong>, West Chester University Abstract:\u00a0<\/strong>In this work we analyze Subversion, a recently proposed all-small combinatorial ruleset. Often, the atomic weight calculus, allowing the recursive computation of the atomic weight of a game G with the atomic weights of its options, is not easy. However, Subversion is an interesting case such that the theoretical difficult cases are reduced to a finite number of cases and organized in a table. With the table, given a Subversion position (a,b), a\u2265b, using the Euclidean algorithm and the continued fraction representation of a\/b, it is possible to compute aw(a,b). An algorithm for that is presented.
Working Sessions, Afternoons (14:00-18:00) – BuildingC8, Rooms 8.2.11,\u00a08.2.13,\u00a08.2.17,8.2.19<\/strong><\/p>\nREGISTRATION<\/span><\/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 2 (CGTC2) held in Lisbon in January 2017.\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>
Brett Stevens<\/a>, Carleton University<\/span>
Carlos Pereira dos Santos<\/a>, LA & CEAFEL-University of Lisbon<\/span>
Gabriel Renault<\/a>, Sopra Steria<\/span>
Jo\u00e3o Pedro Neto<\/a>, University of Lisbon<\/span>
Jorge Nuno Silva<\/a>, University of Lisbon<\/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<\/strong>, LA<\/span><\/p>\n![\"\"](\"http:\/\/cgtc.eu\/Media\/CGTC2\/Images\/Prog.png\")
<\/span><\/p>\n
<\/span><\/span><\/strong><\/p>\nScoring mean value theorem\u00a0<\/span><\/h5>\n
Eternal Picaria<\/span><\/h5>\n
<\/b><\/p>\n
(joint work with Urban Larsson)<\/span><\/p>\nSolving mis\u00e8re illuNIMati through boomerang games<\/span><\/h5>\n
<\/span><\/p>\nA two-player pebbling game<\/span><\/h6>\n
<\/span><\/p>\n
(joint work with Mike Fisher)
<\/span><\/p>\n<\/span><\/h6>\n
Cricket pitch perfection<\/span><\/h6>\n
<\/span><\/p>\n
(joint work with Paul Ottaway and Angela Siegel)<\/span><\/p>\n<\/span><\/h6>\n
The OSLO game of Hives<\/span><\/h6>\n
<\/span><\/p>\nAtomic weight calculus of Subversion<\/span><\/h6>\n
<\/span><\/p>\n
(joint work with Neil McKay, Richard J. Nowakowski, Paul Ottaway and Carlos Santos)
<\/span><\/p>\n