Blackboard

CS tutoring schedule

My current research is in the related areas of computational social choice, algorithmic game theory and artificial intelligence (particularly multi-agent systems and machine learning).  My Ph.D. dissertation was one of the earliest in computational social choice.  Here's a lovely video introducing computational social choice; my research is mostly concerned with strategyproofness.  I also sometimes explore the areas of languages, compilers, game development, computer science education and theory of computation.  I serve as a research partner with MedHab, a manufacturer of electronic medical devices.  My ORCID iD is https://orcid.org/0000-0002-1359-8094.  Selected publications (some listed on my ResearchGate, Google Scholar, Semantic Scholar, ACM author and dblp profiles):

• Anna Porter and Rob LeGrand.  Evaluating approaches to evolving neural Reversi players.  Angelo State University Student Research Journal.  Angelo State University, summer 2019.
• Michael McCarver and Rob LeGrand.  Evolving a Hex-playing agent.  Angelo State University Student Research Journal.  Angelo State University, spring 2018.
• Simon Olsen and Rob LeGrand.  Creating a poker-playing program using evolutionary computation.  Crius: Undergraduate Research Journal, Volume 2.1, pages 61–70.  Angelo State University, fall 2014.
• Timothy E. Roden, Rob LeGrand, Raul Fernandez, Jacqueline Brown, James (Ed) Deaton and Johnny Ross Jr.  Development of a smart insole tracking system for physical therapy and athletics.  In Proceedings of the 7th International Conference on Pervasive Technologies Related to Assistive Environments (PETRA 2014), article no. 40.  ACM Press, May 2014.
• Timothy E. Roden and Rob LeGrand.  Experiences teaching a course in Android game development.  In Proceedings of the 9th International Conference on Foundations of Digital Games (FDG 2014).  Society for the Advancement of the Science of Digital Games, April 2014.
• Timothy E. Roden and Rob LeGrand.  Growing a computer science program with a focus on game development.  In Proceedings of the 44th ACM Technical Symposium on Computer Science Education (SIGCSE 2013), pages 555–560.  ACM Press, March 2013.
• Timothy E. Roden and Rob LeGrand.  A foundation for growth: an introductory course in computer game development.  Technical report (CSTR-LU no. 4), Department of Computer Science, Lamar University, Beaumont, Texas, October 2012.
• Rob LeGrand, Timothy Roden and Ron K. Cytron.  Nonmanipulable collective decision-making for games.  In Ashok Kumar, Jim Etheredge and Aaron Boudreaux, editors, Algorithmic and Architectural Gaming Design: Implementation and Development, pages 67–81.  IGI Global, Hershey, Pennsylvania, May 2012.
• Rob LeGrand and Ron K. Cytron.  Approval-rating systems that never reward insincerity.  Presented at the 2nd International Workshop on Computational Social Choice (COMSOC 2008), Liverpool, England, September 2008.
• Rob LeGrand.  Computational Aspects of Approval Voting and Declared-Strategy Voting.  Ph.D. dissertation (WUCSE-2013-43), Department of Computer Science and Engineering, Washington University, St. Louis, Missouri, April 2008.
• Delvin Defoe, Rob LeGrand and Ron K. Cytron.  On the connection between functional programming languages and real-time Java scoped memory.  In Proceedings of the 5th International Workshop on Java Technologies for Real-time and Embedded Systems (JTRES 2007), pages 73–82.  ACM Press, September 2007.
• Rob LeGrand, Evangelos Markakis and Aranyak Mehta.  Some results on approximating the minimax solution in approval voting.  In Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), pages 1185–1187.  International Foundation for Autonomous Agents and Multiagent Systems, May 2007.
• Delvin Defoe, Rob LeGrand and Ron K. Cytron.  Cost analysis for real-time Java scoped-memory areas.  Journal of Systemics, Cybernetics and Informatics, Volume 5, No. 4, pages 70–77.  International Institute of Informatics and Systemics, 2007.
• Rob LeGrand, Evangelos Markakis and Aranyak Mehta.  Approval voting: Local search heuristics and approximation algorithms for the minimax solution.  Presented at the 1st International Workshop on Computational Social Choice (COMSOC 2006), Amsterdam, Netherlands, December 2006.
• Tobias Mann, Morgan Deters, Rob LeGrand and Ron K. Cytron.  Static determination of allocation rates to support real-time garbage collection.  In Proceedings of the 6th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2005), pages 193–202.  ACM Press, June 2005.
• Rob LeGrand.  Analysis of the minimax procedure.  Technical report (WUCSE-2004-67), Department of Computer Science and Engineering, Washington University, St. Louis, Missouri, November 2004.

Full curriculum vitae

• Duolingo
• Clozemaster
• Memrise
• Kattis
• Khan Academy
• Codecademy
• freeCodeCamp
• SoloLearn
• CodeSignal
• CodinGame
• DataCamp
• CodePen