CMSC 203: Discrete Structures (Fall 2004)

AI Alerts
Kurzweil AI

Locations of visitors to this page

Adjunct Assistant Professor
Department of Computer Science and Electrical Engineering
University of Maryland Baltimore County

Ph.D., Computer Science, UMBC, 2005
M.S., Computer Science, UMBC, 2002
B.S., Mathematics with Computing, University of Notre Dame, 1998

Dissertation: Organizational Learning and Network Adaptation in Multi-agent Systems
Advisor: Prof. Marie desJardins

Multi-Agent Planning and LEarning Laboratory (MAPLE)

Research Interests: How and why networks evolve? (and the implications for distributed intelligent systems, multi-agent learning, computational economics, cognitive systems)

Selected Publications:

  • M. Gaston, M. Kraetzl, and W. Wallis. Using Graph Diameter for Change Detection in Dynamic Networks. Australasian Journal of Combinatorics, Volume 35, 2006, pp. 299-311.

  • M. Gaston and M. desJardins. Agent-Organized Networks for Multi-Agent Production and Exchange. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005). Pittsburgh, PA, July 2005.

  • M. Gaston and M. desJardins. Agent-Organized Networks for Dynamic Team Formation. In Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2005). Utrecht, Netherlands, July 2005.

  • M. Gaston and M. desJardins. Social Networks and Multi-Agent Organizational Performance. In Proceedings of the 18th International Florida Artificial Intelligence Research Society Conference (FLAIRS 2005), special track on ``AI for Social Networks, Social Networks for AI.'' Clearwater, FL, May 2005. (Formerly titled "Social Network Structures and The Impact on Multi-Agent System Dynamics")

  • M. Gaston, J. Simmons, and M. desJardins. Adapting Network Structures for Efficient Team Formation. In Proceedings of the AAAI 2004 Fall Symposium on Artificial Multi-agent Learning. Washington, D.C., October, 2004.

  • N. Curet, J. DeVinney, and M. Gaston. An Efficient Network Flow Code for Finding All Minimum Cost s-t Cutsets. Computers & Operations Research, 29 (3), 2002, pp. 205-219.

    Contact Information:
    mgasto1 at
    PGP Public Key

  • Author: Matthew Gaston
    Last Modified: Saturday, 24-Feb-2007 16:39:19 EST
    Copyright ©2000-2005