Dorota H. Kieronska

Learn More
In multiagent systems, an agent does not usually have complete information about the preferences and decision making processes of other agents. This might prevent the agents from making coordinated choices, purely due to their ignorance of what others want. This paper describes the integration of a learning module into a communication-intensive negotiating(More)
Restriction site mapping programs construct maps by generating permutations of fragments and checking for consistency. Unfortunately many consistent maps often are obtained within the experimental error bounds, even though there is only one actual map. A particularly efficient algorithm is presented that aims to minimize error bounds between restriction(More)
In multi-agent systems, most of the time, an agent does not have complete information about the preferences and decision making processes of other agents. This prevents even the cooperative agents from making coordinated choices, purely due to their ignorance of what others want. To overcome this problem, traditional coordination methods rely heavily on(More)
We present a framework for team coordination under incomplete information based on the theory of incomplete information games. When the true distribution of the uncertainty involved is not known in advance, we consider a repeated interaction scenario and show that the agents can learn to estimate this distribution and share their estimations with one(More)