Papers

Articles in preparation

[1]
Édouard Bonnet and Abdallah Saffidine. The importance of rank in trick-taking card games. In Under review, June 2016. [ bib | .pdf ]

Refereed international journal articles

[5]
Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, and Abdallah Saffidine. Positional scoring-based allocation of indivisible goods. Autonomous Agents and Multi-Agent Systems (JAAMAS), 31(3):628--655, May 2017. [ bib | DOI ]
[4]
Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. On the complexity of connection games. Theoretical Computer Science (TCS), 644:2--28, June 2016. [ bib | DOI | arXiv ]
[3]
Edith Elkind, Jérôme Lang, and Abdallah Saffidine. Condorcet winning sets. Social Choice and Welfare (SCW), 44(3):493--517, October 2014. [ bib | DOI ]
[2]
Abdallah Saffidine. The game description language is Turing complete. IEEE Transactions in Computational Intelligence and AI in Games (TCIAIG), 6(4):320--324, September 2014. [ bib | DOI | .pdf ]
[1]
Abdallah Saffidine, Tristan Cazenave, and Jean Méhat. UCD: Upper Confidence bound for rooted Directed acyclic graphs. Knowledge-Based Systems (KBS), 34:26--33, December 2011. [ bib | DOI | .pdf ]

Refereed full papers in international conferences with published proceedings

[23]
Nicholas Mattei, Abdallah Saffidine, and Toby Walsh. A formal model and mechanism for online organ matching. In Carles Sierra, editor, 26th International Joint Conference on Artificial Intelligence (IJCAI), pages 1--6, Melbourne, Australia, August 2017. AAAI Press. [ bib ]
[22]
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. The parameterized complexity of positional games. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming (ICALP), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 90:1--90:14, Warsaw, Poland, July 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ bib | DOI | arXiv ]
[21]
Miguel Couceiro, Pierre Mercuriali, Romain Péchoux, and Abdallah Saffidine. Median based calculus for lattice polynomials and monotone boolean functions. In Elena Dubrova, Felip Manyà, and Shinobu Nagayama, editors, 47th IEEE International Symposium on Multiple-Valued Logic (ISMVL), pages 1--6, Novi Sad, Serbia, May 2017. IEEE Computer Society. [ bib ]
[20]
Tristan Cazenave, Abdallah Saffidine, Michael Schofield, and Michael Thielscher. Nested Monte Carlo search for two-player games. In Dale Schuurmans and Michael Wellman, editors, 30th AAAI Conference (AAAI), pages 687--693, Phoenix, USA, February 2016. AAAI Press. [ bib | http ]
[19]
Marie-Liesse Cauwet, Olivier Teytaud, Hua-Min Liang, Shi-Jim Yen, Tristan Cazenave, Abdallah Saffidine, Hung-Hsuan Lin, and I-Chen Wu. Depth, balancing, and limits of the Elo model. In Shi-Jim Yen, Tristan Cazenave, and Philip Hingston, editors, IEEE Conference on Computational Intelligence and Games (CIG), pages 376--382, Tainan, Taiwan, August 2015. IEEE. [ bib | DOI | arXiv ]
[18]
Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. Draws, zugzwangs, and PSPACE-completeness in the slither connection game. In Aske Plaat, Jaap van den Herik, and Walter Kosters, editors, Advances in Computer Games (ACG), pages 160--176, Leiden, The Netherlands, July 2015. Springer. [ bib | DOI | Journal Version ]
[17]
Abdallah Saffidine, Olivier Teytaud, and Shi-Jim Yen. Go complexities. In Aske Plaat, Jaap van den Herik, and Walter Kosters, editors, Advances in Computer Games (ACG), pages 76--88, Leiden, The Netherlands, July 2015. Springer. [ bib | DOI ]
[16]
Timothy Cerexhe, David Rajaratnam, Abdallah Saffidine, and Michael Thielscher. A systematic solution to the (de-)composition problem in general game playing. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, 21st European Conference on Artificial Intelligence (ECAI), pages 195--200, Prague, Czech Republic, August 2014. IOS Press. [ bib | DOI ]
[15]
Javier Romero, Abdallah Saffidine, and Michael Thielscher. Solving the inferential frame problem in the general game description language. In Carla E. Brodley and Peter Stone, editors, 28th AAAI Conference (AAAI), pages 515--521, Québec City, Canada, July 2014. AAAI Press. [ bib | http ]
[14]
Abdallah Saffidine and Tristan Cazenave. Developments on product propagation. In H. van den Herik, Hiroyuki Iida, and Aske Plaat, editors, 8th International Conference on Computers and Games (CG), volume 8427 of Lecture Notes in Computer Science, pages 100--110. Springer, Yokohama, Japan, August 2013. [ bib | .pdf ]
[13]
Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. Havannah and Twixt are PSPACE-complete. In H. van den Herik, Hiroyuki Iida, and Aske Plaat, editors, 8th International Conference on Computers and Games (CG), volume 8427 of Lecture Notes in Computer Science, pages 174--185. Springer, Yokohama, Japan, August 2013. [ bib | arXiv | Journal Version | .pdf ]
[12]
Abdallah Saffidine, Nicolas Jouandeau, Cédric Buron, and Tristan Cazenave. Material symmetry to partition endgame tables. In H. van den Herik, Hiroyuki Iida, and Aske Plaat, editors, 8th International Conference on Computers and Games (CG), volume 8427 of Lecture Notes in Computer Science, pages 186--198. Springer, Yokohama, Japan, August 2013. [ bib | .pdf ]
[11]
Édouard Bonnet, Florian Jamain, and Abdallah Saffidine. On the complexity of trick-taking card games. In Francesca Rossi, editor, 23rd International Joint Conference on Artificial Intelligence (IJCAI), pages 482--488, Beijing, China, August 2013. AAAI Press. [ bib | .pdf ]
[10]
Marc Lanctot, Abdallah Saffidine, Joel Veness, Chris Archibald, and Mark Winands. Monte Carlo *-minimax search. In Francesca Rossi, editor, 23rd International Joint Conference on Artificial Intelligence (IJCAI), pages 580--586, Beijing, China, August 2013. AAAI Press. [ bib | arXiv ]
[9]
Hans van Ditmarsch, Jérôme Lang, and Abdallah Saffidine. Strategic voting and the logic of knowledge. In Burkhard C. Schipper, editor, 14th conference on Theoretical Aspects of Rationality and Knowledge (TARK), pages 196--205, Chennai, India, January 2013. [ bib ]
[8]
David Churchill, Abdallah Saffidine, and Michael Buro. Fast heuristic search for RTS game combat scenarios. In Mark Riedl and Gita Sukthankar, editors, 8th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE), pages 112--117, Palo Alto, California, USA, October 2012. AAAI Press. [ bib | http ]
[7]
Abdallah Saffidine. Minimal proof search for modal logic K model checking. In Luis del Cerro, Andreas Herzig, and Jérôme Mengin, editors, 13th European Conference on Logics in Artificial Intelligence (JELIA), volume 7519 of Lecture Notes in Computer Science, pages 346--358. Springer, Toulouse, France, September 2012. [ bib | DOI | arXiv ]
[6]
Abdallah Saffidine and Tristan Cazenave. Multiple-outcome proof number search. In Luc De Raedt, Christian Bessiere, Didier Dubois, Patrick Doherty, Paolo Frasconi, Fredrik Heintz, and Peter Lucas, editors, 20th European Conference on Artificial Intelligence (ECAI), volume 242 of Frontiers in Artificial Intelligence and Applications, pages 708--713, Montpellier, France, August 2012. IOS Press. [ bib | DOI | .pdf ]
[5]
Abdallah Saffidine, Hilmar Finnsson, and Michael Buro. Alpha-beta pruning for games with simultaneous moves. In 26th AAAI Conference (AAAI), pages 556--562, Toronto, Canada, July 2012. AAAI Press. [ bib | .pdf ]
[4]
Abdallah Saffidine, Nicolas Jouandeau, and Tristan Cazenave. Solving Breakthough with race patterns and Job-Level Proof Number Search. In H. van den Herik and Aske Plaat, editors, Advances in Computer Games (ACG), volume 7168 of Lecture Notes in Computer Science, pages 196--207. Springer, Tilburg, Netherlands, November 2011. [ bib | DOI | .pdf ]
[3]
Edith Elkind, Jérôme Lang, and Abdallah Saffidine. Choosing collectively optimal sets of alternatives based on the Condorcet criterion. In Toby Walsh, editor, 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 186--191, Barcelona, Spain, July 2011. AAAI Press. [ bib | Journal Version | .pdf ]
[2]
Abdallah Saffidine, Tristan Cazenave, and Jean Méhat. UCD: Upper Confidence bound for rooted Directed acyclic graphs. In International Conference on Technologies and Applications of Artificial Intelligence (TAAI), pages 467--473, Taiwan, November 2010. IEEE Computer Society Press. Merit paper award. [ bib | DOI | Journal Version ]
[1]
Tristan Cazenave and Abdallah Saffidine. Score bounded Monte Carlo Tree Search. In H. van den Herik, Hiroyuki Iida, and Aske Plaat, editors, Computers and Games (CG), volume 6515 of Lecture Notes in Computer Science, pages 93--104. Springer, Kanazawa, Japan, September 2010. [ bib | DOI | .pdf ]

Other refereed contributions

[18]
Nathan R. Sturtevant and Abdallah Saffidine. A study of forward versus backwards endgame solvers with results in chinese checkers. In Tristan Cazenave, Abdallah Saffidine, and Mark Winands, editors, Computer Games Workshop @ IJCAI (CGW), Melbourne, Australia, August 2017. [ bib ]
[17]
Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, and Kevin Tran. Minesweeper with limited moves. In Tristan Cazenave, Abdallah Saffidine, and Mark Winands, editors, Computer Games Workshop @ IJCAI (CGW), Melbourne, Australia, August 2017. [ bib ]
[16]
Michael Schofield, Tristan Cazenave, Abdallah Saffidine, and Michael Thielscher. Discounting and pruning for nested playouts in General Game Playing. In Stephan Schiffel, Michael Thielscher, and Julian Togelius, editors, 4th Workshop on General Intelligence in Game-Playing Agents (GIGA), pages 31--38, Buenos Aires, Argentina, July 2015. [ bib | Conference Version ]
[15]
Marc Chee, Abdallah Saffidine, and Michael Thielscher. A principled approach to the problem of chunking in uct. In Tristan Cazenave, Stefan Edelkamp, and Mark Winands, editors, Computer Games Workshop @ IJCAI (CGW), Buenos Aires, Argentina, July 2015. [ bib ]
[14]
Carlos Linares López and Abdallah Saffidine. A preliminary selection of problems in heuristic search. In Levi Lelis and Roni Stern, editors, 8th Annual Symposium on Combinatorial Search (SOCS), pages 186--190, Ein Gedi, Israel, June 2015. AAAI Press. [ bib | http ]
[13]
Édouard Bonnet and Abdallah Saffidine. On the complexity of general game playing. In Tristan Cazenave, Mark H.M. Winands, and Yngvi Björnsson, editors, Computer Games Workshop @ ECAI (CGW), volume 504 of Communications in Computer and Information Science, pages 90--104, Prague, Czech Republic, August 2014. Springer. [ bib | DOI ]
[12]
Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, and Abdallah Saffidine. Axiomatic and computational aspects of scoring allocation rules for indivisible goods. In 5th International Workshop on Computational Social Choice (COMSOC), pages 1--22, Pittsburgh, USA, June 2014. [ bib | Journal Version ]
[11]
Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Trung Thanh Nguyen, Jörg Rothe, and Abdallah Saffidine. Positional scoring rules for the allocation of indivisible goods. In 11th European Workshop on Multi-Agent Systems (EUMAS), pages 1--14, Toulouse, France, December 2013. [ bib | Journal Version ]
[10]
Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, and Mark H.M. Winands. Monte carlo *-minimax search. In 25th Benelux Conference on Artificial Intelligence (BNAIC), pages 330--331, Delft, The Netherlands, November 2013. [ bib | Conference Version ]
[9]
Michael Schofield and Abdallah Saffidine. High speed forward chaining for general game playing. In 3rd Workshop on General Intelligence in Game-Playing Agents (GIGA), pages 31--38, Beijing, China, August 2013. Best student paper award. [ bib | .pdf ]
[8]
Abdallah Saffidine. Solving Games and All That. PhD thesis, Université Paris-Dauphine, Paris, France, July 2013. [ bib | .pdf ]
[7]
Abdallah Saffidine and Tristan Cazenave. A general multi-agent modal logic K framework for game tree search. In Computer Games Workshop @ ECAI (CGW), pages 1--18, Montpellier, France, August 2012. [ bib | .pdf ]
[6]
Marc Lanctot, Abdallah Saffidine, Joel Veness, and Chris Archibald. Sparse sampling for adversarial games. In Computer Games Workshop @ ECAI (CGW), pages 1--13, Montpellier, France, August 2012. [ bib | Conference Version ]
[5]
Hans van Ditmarsch, Jérôme Lang, and Abdallah Saffidine. Strategic voting and the logic of knowledge. In ESSLLI 2012 workshop 'Strategies for Learning, Belief Revision and Preference Change' (LBP), Opole, Poland, August 2012. Best paper award. [ bib | Full Version ]
[4]
Hans van Ditmarsch, Jérôme Lang, and Abdallah Saffidine. Strategic voting and the logic of knowledge. In 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1247--1248, Valencia, Spain, June 2012. IFAAMAS. [ bib | Full Version | .pdf ]
[3]
Abdallah Saffidine and Tristan Cazenave. A forward chaining based game description language compiler. In 2nd Workshop on General Intelligence in Game-Playing Agents (GIGA), pages 69--75, Barcelona, Spain, July 2011. [ bib | .pdf ]
[2]
Abdallah Saffidine and Tristan Cazenave. Generalized proof number search. In 6th Journées Francophones Modèles Formels de l'Interaction (MFI), pages 131--138, Rouen, France, June 2011. [ bib | Conference Version | .pdf ]
[1]
Tristan Cazenave and Abdallah Saffidine. Utilisation de la recherche arborescente Monte-Carlo au Hex. Revue d'Intelligence Artificielle (RIA), 23(2-3):183--202, 2009. [ bib | DOI | .pdf ]

Non-refereed contributions

[12]
Lisa Rougetet and Abdallah Saffidine. The roots of combinatorial game theory---history and foresights. In 20th Board Games Studies Colloquium (BGS), Copenhagen, Denmark, May 2017. [ bib ]
[11]
Abdallah Saffidine. Games, classes, and algorithms: Selected results and a roadmap. In 18th Board Games Studies Colloquium (BGS), La Tour-de-Peilz, Switzerland, April 2015. [ bib ]
[10]
Édouard Bonnet and Abdallah Saffidine. Complexité des jeux. Bulletin de la ROADEF, 31:9--12, January 2014. Invited. [ bib ]
[9]
Abdallah Saffidine. General game playing and the game description language. In Sydney Area Programming Languages INterest Group (SAPLING), Sydney, Australia, December 2013. [ bib ]
[8]
Edith Elkind, Jérôme Lang, and Abdallah Saffidine. Choix collectif d'un ensemble optimal de candidats, avec l'aide de Condorcet. In 13th Congrés de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), Angers, France, April 2012. [ bib | Conference Version ]
[7]
Abdallah Saffidine. General game playing and the game description language. In Off the Beaten Track: Underrepresented Problems for Programming Language Researchers (OBT), Philadelphia, USA, January 2012. [ bib | .pdf ]
[6]
Abdallah Saffidine. A playing-level measure of game depth. In 14th Board Games Studies Colloquium (BGS), Bruges, Belgium, May 2011. [ bib ]
[5]
Abdallah Saffidine. Moccos wins the Phantom-Go tournament. ICGA Journal, 34(1):35--37, March 2011. [ bib | .pdf ]
[4]
Abdallah Saffidine. Some improvements for Monte Carlo Tree Search, Game Description Language compilation, score bounds and transpositions. Master's thesis, Université Paris-Dauphine, Paris, France, September 2010. [ bib | .pdf ]
[3]
Tristan Cazenave and Abdallah Saffidine. Monte Carlo Hex. In 13th Board Games Studies Colloquium (BGS), Paris, France, April 2010. [ bib | .pdf ]
[2]
Abdallah Saffidine. LTL model checking with use of generalised stuttering and characteristic patterns, September 2009. Master's Internship report. [ bib | .pdf ]
[1]
Abdallah Saffidine. Utilisation d'UCT au Hex, September 2008. Bachelor's Thesis. [ bib | .pdf ]

This file was generated by bibtex2html 1.98.