M-DPOP: faithful distributed implementation of efficient social choice problems

MaRDI QIDQ3624147zbMATH OpenFDO

Authors Adrian Petcu, David C. Parkes, Boi Faltings

Publication date 28 April 2009

zbMATH Keywords

Distributed Constraint Optimization Problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A class of algorithms for distributed constraint optimization.
• scientific article; zbMATH DE number 6519655
• A distributed social choice protocol for combinatorial domains
• Algorithmic mechanism design (extended abstract)
• Asymmetric distributed constraint optimization problems

Cited in

(3)

• M-DPOP
• Solving distributed constraint optimization problems using logic programming
• A distributed social choice protocol for combinatorial domains

This page was built for publication: M-DPOP: faithful distributed implementation of efficient social choice problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624147)