Computational social choice for coordination in agent networks
DOI10.1007/S10472-015-9462-XzbMATH Open1371.68278OpenAlexW1831428928MaRDI QIDQ314440FDOQ314440
Authors: Anisse Ismaili, Patrice Perny 
Publication date: 16 September 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9462-x
Recommendations
- A distributed social choice protocol for combinatorial domains
- Consensus and Cooperation in Networked Multi-Agent Systems
- Cooperative agents. Application in the social sciences
- A methodology for modeling coordination in intelligent agent societies
- scientific article; zbMATH DE number 67443
- Patterns of cooperation: fairness and coordination in networks of interacting agents
- scientific article; zbMATH DE number 5159139
- Learning to coordinate in social networks
combinatorial optimizationgraphical modelsagent networkscomputational social choicepreference modelling
Social choice (91B14) Combinatorial optimization (90C27) Agent technology and artificial intelligence (68T42)
Cites Work
- Aggregation functions.
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- Worst-case equilibria
- How bad is selfish routing?
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Subjective Probability and Expected Utility without Additivity
- Title not available (Why is that?)
- Interdependence and Additivity in Multivariate, Unidimensional Expected Utility Theory
- Inequalities: theory of majorization and its applications
- A partial k-arboretum of graphs with bounded treewidth
- Handbook of social choice and welfare. Vol. 1.
- Nonserial dynamic programming
- Title not available (Why is that?)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Generalized Gini inequality indices
- On solving linear programs with the ordered weighted averaging objective.
- Tree clustering for constraint networks
- Compact versus noncompact LP formulations for minimizing convex Choquet integrals
- Lazy propagation: A junction tree inference algorithm based on lazy evaluation
- Empathetic decision making in social networks
- LP solvable models for multiagent fair allocation problems
- Title not available (Why is that?)
- Graphical games
- Routing games
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Title not available (Why is that?)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Cited In (3)
Uses Software
This page was built for publication: Computational social choice for coordination in agent networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314440)
