We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
In this paper we introduce the Semi-Cooperative Extended Incremental Multiagent Agreement Problem with Preferences (SC-EIMAPP). In SC-EIMAPPs, variables arise over time. For each ...
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...