Switch to: References

Add citations

You must login to add citations.
  1. On the computational complexity of coalitional resource games.Michael Wooldridge & Paul E. Dunne - 2006 - Artificial Intelligence 170 (10):835-871.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Solving Highly Cyclic Distributed Optimization Problems Without Busting the Bank: A Decimation-based Approach.Jesús Cerquides, Juan Antonio Rodríguez-Aguilar, Rémi Emonet & Gauthier Picard - 2021 - Logic Journal of the IGPL 29 (1):72-95.
    In the context of solving large distributed constraint optimization problems, belief-propagation and incomplete inference algorithms are candidates of choice. However, in general, when the problem structure is very cyclic, these solution methods suffer from bad performance, due to non-convergence and many exchanged messages. As to improve performances of the MaxSum inference algorithm when solving cyclic constraint optimization problems, we propose here to take inspiration from the belief-propagation-guided decimation used to solve sparse random graphs. We propose the novel DeciMaxSum method, which (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs.Tal Grinshpoun, Tamir Tassa, Vadim Levit & Roie Zivan - 2019 - Artificial Intelligence 266 (C):27-50.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Privacy preserving solution of DCOPs by mediation.Pablo Kogan, Tamir Tassa & Tal Grinshpoun - 2023 - Artificial Intelligence 319 (C):103916.
    Download  
     
    Export citation  
     
    Bookmark  
  • AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Governing convergence of Max-sum on DCOPs through damping and splitting.Liel Cohen, Rotem Galiki & Roie Zivan - 2020 - Artificial Intelligence 279 (C):103212.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Counterexamples and amendments to the termination and optimality of ADOPT-based algorithms.Koji Noshiro & Koji Hasebe - 2024 - Artificial Intelligence 329 (C):104083.
    Download  
     
    Export citation  
     
    Bookmark  
  • Concurrent forward bounding for distributed constraint optimization problems.Arnon Netzer, Alon Grubshtein & Amnon Meisels - 2012 - Artificial Intelligence 193 (C):186-216.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems.Younes Mechqrane, Mohamed Wahbi, Christian Bessiere & Kenneth N. Brown - 2020 - Artificial Intelligence 278 (C):103169.
    Download  
     
    Export citation  
     
    Bookmark  
  • Cooperative gazing behaviors in human multi-robot interaction.Tian Xu, Hui Zhang & Chen Yu - 2013 - Interaction Studies. Social Behaviour and Communication in Biological and Artificial Systemsinteraction Studies / Social Behaviour and Communication in Biological and Artificial Systemsinteraction Studies 14 (3):390-418.
    When humans are addressing multiple robots with informative speech acts, their cognitive resources are shared between all the participating robot agents. For each moment, the user’s behavior is not only determined by the actions of the robot that they are directly gazing at, but also shaped by the behaviors from all the other robots in the shared environment. We define cooperative behavior as the action performed by the robots that are not capturing the user’s direct attention. In this paper, we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • PC-SyncBB: A privacy preserving collusion secure DCOP algorithm.Tamir Tassa, Tal Grinshpoun & Avishay Yanai - 2021 - Artificial Intelligence 297 (C):103501.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Bounded approximate decentralised coordination via the max-sum algorithm.A. Rogers, A. Farinelli, R. Stranders & N. R. Jennings - 2011 - Artificial Intelligence 175 (2):730-759.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Forward bounding on pseudo-trees for DCOPs and ADCOPs.Omer Litov & Amnon Meisels - 2017 - Artificial Intelligence 252 (C):83-99.
    Download  
     
    Export citation  
     
    Bookmark