Sciweavers

436 search results - page 42 / 88
» The complexity of contract negotiation
Sort
View
HUMAN
2003
Springer
14 years 4 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
CSR
2009
Springer
14 years 5 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
ATAL
2005
Springer
14 years 4 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 11 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
RULEML
2005
Springer
14 years 4 months ago
Extending the SweetDeal Approach for e-Procurement Using SweetRules and RuleML
We show the first detailed realistic e-business application scenario that uses and exploits capabilities of the SweetRules V2.1 toolset for e-contracting using the SweetDeal approa...
Sumit Bhansali, Benjamin N. Grosof