Sciweavers

98 search results - page 12 / 20
» Extending SATPLAN to Multiple Agents
Sort
View
AAAI
2012
11 years 11 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan
AAAI
2006
13 years 10 months ago
Performing Incremental Bayesian Inference by Dynamic Model Counting
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
Wei Li 0002, Peter van Beek, Pascal Poupart
AAMAS
2011
Springer
13 years 3 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
AAAI
2006
13 years 10 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
WCE
2007
13 years 9 months ago
Adaptive Automata Community Detection and Clustering: A generic methodology
— We present in this paper a generic methodology based on genetic automata for modelling community detection. With Communities, we deal with dynamic organizations which are self-...
Rawan Ghnemat, Cyrille Bertelle, Gérard Hen...