A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...