Sciweavers

1662 search results - page 168 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
196
Voted
AAAI
2011
14 years 4 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
HUMAN
2003
Springer
15 years 9 months ago
A Framework of Winner Determination Algorithms for Internet Auctions
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
Juhnyoung Lee, Sang-goo Lee, Suekyung Lee
ICS
2010
Tsinghua U.
15 years 8 months ago
Robust Perfect Revenue From Perfectly Informed Players
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
Jing Chen, Avinatan Hassidim, Silvio Micali
132
Voted
AGI
2008
15 years 5 months ago
Temporal Action Logic for Question Answering in an Adventure Game
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
Martin Magnusson, Patrick Doherty
ATAL
2010
Springer
15 years 5 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach