Solving CSPs with Naming Games

DOI10.1007/978-3-642-03251-6_2MaRDI QIDQ5191404zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stefano Bistarelli, Giorgio Gosti

Publication date 6 August 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03251-6_2

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Other game-theoretic models (91A40)

Recommendations

• Solving Distributed CSPs Probabilistically
• scientific article; zbMATH DE number 2084769
• Naming game. Models, simulations and analysis
• Multi-agent oriented constraint satisfaction
• How to reach linguistic consensus: a proof of convergence for the naming game

Cites work

• A graph coloring algorithm for large scheduling problems
• scientific article; zbMATH DE number 67481 (Why is no real title available?)
• Self-stabilizing systems in spite of distributed control
• Sharp transition towards shared vocabularies in multi-agent systems
• Sur le coloriage des graphs

This page was built for publication: Solving CSPs with Naming Games

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