We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...