The effect of policies for selecting the solution of a DisCSP on privacy loss

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 3, Issue , 2004, Pages 1396-1397

  Silaghi, Marius Cǎlin ^a   Rajeshirke, Vaibhav ^a  

^a FLORIDA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED CONSTRAINT SATISFACTION (DISTRIBUTED CSP); LEXICOGRAPHICAL ORDER; PERMUTATIONS; PRIVACY LOSS;

COMPUTER SIMULATION; GRAPH THEORY; INFORMATION ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONSTRAINT THEORY;

EID: 4544252889     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. B. Faltings. Incentive compatible open constraint optimization. In Electronic Commerce, 2003.
2. M. Silaghi. A suite of secure multi-party computation algorithms for solving distributed CSPs. Technical Report CS-2004-05, FIT, 2004. www.cs.fit.edu/~tr/tr2004.html.
3. R. Wallace and M. Silaghi. Using privacy loss to guide decisions in distributed CSP search. In FLAIRS'04, 2004.
4. M. Yokoo, K. Suzuki, and K. Hirayama. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In CP, 2002.