Sciweavers

881 search results - page 119 / 177
» Solving satisfiability problems with preferences
Sort
View
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
IAT
2003
IEEE
14 years 29 days ago
Agent-based decision support for actual-world procurement scenarios
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
Juan A. Rodríguez-Aguilar, Andrea Giovannuc...
HUMAN
2003
Springer
14 years 26 days 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
EDBTW
2006
Springer
13 years 11 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
IJAR
2007
90views more  IJAR 2007»
13 years 7 months ago
An argumentation framework for merging conflicting knowledge bases
The problem of merging multiple sources of information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, e...
Leila Amgoud, Souhila Kaci