Sciweavers

11160 search results - page 1993 / 2232
» Incompleteness in a General Setting
Sort
View
ATAL
2007
Springer
16 years 24 days ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
ATAL
2007
Springer
16 years 24 days ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
ATAL
2007
Springer
16 years 24 days ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
ATAL
2007
Springer
16 years 24 days ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
ATAL
2007
Springer
16 years 24 days ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer
« Prev « First page 1993 / 2232 Last » Next »