Author of the publication

Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds.

, , , , and . CP, volume 6876 of Lecture Notes in Computer Science, page 660-674. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Asynchronous Weak-Commitment Search for Solving Large-Scale Distributed Constraint Satisfaction Problems.. ICMAS, page 467. The MIT Press, (1995)Adaptive price update in distributed Lagrangian relaxation protocol., , and . AAMAS (2), page 1033-1040. IFAAMAS, (2009)Directed soft arc consistency in pseudo trees., , , , and . AAMAS (2), page 1065-1072. IFAAMAS, (2009)Strategyproof Matching with Minimum Quotas and Initial Endowments: (Extended Abstract)., , , , and . AAMAS, page 1349-1350. ACM, (2016)Efficiency in Truthful Auctions via a Social Network., , , and . CoRR, (2019)Secure Generalized Vickrey Auction without Third-party Servers., and . Financial Cryptography, volume 3110 of Lecture Notes in Computer Science, page 132-146. Springer, (2004)Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information., , and . CP, volume 2470 of Lecture Notes in Computer Science, page 387-401. Springer, (2002)Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation., , and . CP, volume 1713 of Lecture Notes in Computer Science, page 434-445. Springer, (1999)False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values., and . AAMAS, page 337-344. ACM, (2003)Exploiting Locality of Interaction in Networked Distributed POMDPs., , , , and . AAAI Spring Symposium: Distributed Plan and Schedule Management, page 41-48. AAAI, (2006)