Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/860575.860758acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Incentive compatible open constraint optimization

Published: 14 July 2003 Publication History

Abstract

No abstract available.

References

[1]
Stergiou, K. and Walsh, T.: "Encodings of Non-Binary Constraint Satisfaction Problems," Proceedings of tne AAAI '99, pp. 163--168, 1999
[2]
W. Conen, T. Sandholm: "Partial-revelation VCG Mechanism for Combinatorial Auctions," Proceedings of the AAAI-02, pp. 367--372, 2002
[3]
B. Faltings and S. Macho-Gonzalez: "Open Constraint Satisfaction," Proceedings of CP 2002, LNCS 2470, Springer-Verlag, pp. 356--370, 2002
[4]
E. Ephrati and J. S. Rosenschein: "The Clarke tax as a consensus mechanism among automated agents," Proceedings of the 9th National Conference on Artificial Intelligence, pp. 173--178, San Jose, California, July 1991.

Cited By

View all
  • (2006)Handling self-interest in groups, with minimal costproceedings of the 21st national conference on Artificial intelligence - Volume 210.5555/1597348.1597447(1585-1588)Online publication date: 16-Jul-2006
  • (undefined)Using Iterative Narrowing to Enable Multi-Party Negotiations with Multiple Interdependent IssuesSSRN Electronic Journal10.2139/ssrn.1041041

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems
July 2003
1200 pages
ISBN:1581136838
DOI:10.1145/860575
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. constraint satisfaction
  2. optimization

Qualifiers

  • Article

Conference

AAMAS03
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2006)Handling self-interest in groups, with minimal costproceedings of the 21st national conference on Artificial intelligence - Volume 210.5555/1597348.1597447(1585-1588)Online publication date: 16-Jul-2006
  • (undefined)Using Iterative Narrowing to Enable Multi-Party Negotiations with Multiple Interdependent IssuesSSRN Electronic Journal10.2139/ssrn.1041041

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media