Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems 2003
DOI: 10.1145/860575.860758
|View full text |Cite
|
Sign up to set email alerts
|

Incentive compatible open constraint optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…For the same reason, even though our protocol seems to involve a straightforward constraint optimization problem (i.e., where bids can be viewed as weighted constraints), we have been unable to take advantages of the high efficiency constraint optimizers that have emerged in recent years ( [14], [15]). Such solvers attempt to find the solution(s) that maximize the weights of the satisfied constraints, but they do not account for the crucial additional requirement that the final solution include one constraint from each bidder.…”
Section: B Resultsmentioning
confidence: 99%
“…For the same reason, even though our protocol seems to involve a straightforward constraint optimization problem (i.e., where bids can be viewed as weighted constraints), we have been unable to take advantages of the high efficiency constraint optimizers that have emerged in recent years ( [14], [15]). Such solvers attempt to find the solution(s) that maximize the weights of the satisfied constraints, but they do not account for the crucial additional requirement that the final solution include one constraint from each bidder.…”
Section: B Resultsmentioning
confidence: 99%