Repairmen and Trees

I think I have finally found a problem that has not been studied and is important.  I’m calling it the K-D-Traveling Repairman Problem.  K, the number of repairmen, D, the number of types of repairmen.  The repairman problem is a NP-hard problem and therefore heurstics are used to solve it.  The Predictics group at CMU… Continue reading Repairmen and Trees

Builder Broker

I would imagine that building a house from scratch is pretty difficult for the regular lay person. It would be for me. Making the blue prints, figuring out the permits, what contractors I need and when. Especially if I want to change something or money changes etc there are many dynamic unpredictable things that can… Continue reading Builder Broker

MATSim

Really cool multiagent transportation simulator.  Maybe I will be able to use this in the future.  I want to scale multiagent learning to large number of agents.  I also want to have autonomous vehicles.  So, maybe I can simulate scenarios like finding a parking spot to meet someone, driving in traffic, cooperation between traffic signals and cars, the elimination… Continue reading MATSim

MGS Markov Game Simulator

I found a really cool paper that basically benchmarks a lot of MARL algorithms using MGS, a stochastic game simulator written in Java.  This simulator is like my MALSIM except I only implemented features for repeated games not stochastic games.

Co-Opetition!

I finally found the name that describes what I wanted to know if agents could do back in 2010!!!!  My original question was: I was wondering: if multiple cooperative agent teams are competing, could they learn when it would be in their best interest to cooperate with a competitor. Now I know I was really… Continue reading Co-Opetition!