Computational social choice for coordination in agent networks

DOI10.1007/S10472-015-9462-XMaRDI QIDQ314440zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationgraphical modelsagent networkscomputational social choicepreference modelling

Mathematics Subject Classification ID

Social choice (91B14) Combinatorial optimization (90C27) Agent technology and artificial intelligence (68T42)

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

Cites work

• scientific article; zbMATH DE number 5842485 (Why is no real title available?)
• scientific article; zbMATH DE number 3976693 (Why is no real title available?)
• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• Aggregation functions.
• Compact versus noncompact LP formulations for minimizing convex Choquet integrals
• Empathetic decision making in social networks
• Generalized Gini inequality indices
• Graphical games
• Handbook of social choice and welfare. Vol. 1.
• How bad is selfish routing?
• Inequalities: theory of majorization and its applications
• Interdependence and Additivity in Multivariate, Unidimensional Expected Utility Theory
• LP solvable models for multiagent fair allocation problems
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Nonserial dynamic programming
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• On solving linear programs with the ordered weighted averaging objective.
• Routing games
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Subjective Probability and Expected Utility without Additivity
• The necessity of bounded treewidth for efficient inference in Bayesian networks
• Tree clustering for constraint networks
• Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
• Worst-case equilibria

Cited in

(3)

• Computing optimal outcomes under an expressive representation of settings with externalities
• scientific article; zbMATH DE number 5842485 (Why is no real title available?)
• Compartmental observability approach for the optimal transparency problem in multi-agent systems

Describes a project that uses

Uses Software

• Gurobi

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)