Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability
From MaRDI portal
Publication:6579293
DOI10.1016/J.ARTINT.2024.104131zbMATH Open1545.91227MaRDI QIDQ6579293FDOQ6579293
Publication date: 25 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
computational complexityNash equilibriainteger linear programstree decompositionsdiscrete preference games
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-cooperative games
- Algorithmic Game Theory
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Potential games
- Directed tree-width
- Reaching a Consensus
- Opinion dynamics and learning in social networks
- Automata, Languages and Programming
- Persuasion Bias, Social Influence, and Unidimensional Opinions
- Incentive engineering for Boolean games
- Graph minors. III. Planar tree-width
- Empathetic decision making in social networks
- Simple priorities and core stability in hedonic games
- Decentralized dynamics for finite opinion games
- Social influence and opinions
- Coevolutionary opinion formation games
- Network formation and anti-coordination games
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach
- Diffusion centrality: a paradigm to maximize spread in social networks
- On non-progressive spread of influence through social networks
- NP-completeness in hedonic games
- Coordination games on graphs
- Anti-coordination Games and Stable Graph Colorings
- Social network games
- Representing Utility Functions via Weighted Goals
- On discrete preferences and coordination
- On the complexity of reasoning about opinion diffusion under majority dynamics
- How bad is forming your own opinion?
- Forming \(k\) coalitions and facilitating relationships in social networks
- Hedonic Games
- Price of Pareto optimality in hedonic games
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
- Integrating social influence modeling and user modeling for trust prediction in signed networks
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
This page was built for publication: Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579293)