Most Relevant Explanation: computational complexity and approximation methods

2011 ◽  
Vol 61 (3) ◽  
pp. 159-183 ◽  
Author(s):  
Changhe Yuan ◽  
Heejin Lim ◽  
Michael L. Littman
Keyword(s):  
Computational Complexity ◽  
Approximation Methods ◽  
Relevant Explanation

scholarly journals Fair Division: The Computer Scientist’s Perspective

2020 ◽  
Author(s):  
Toby Walsh
Keyword(s):  
Game Theory ◽  
Computational Complexity ◽  
Knowledge Representation ◽  
Social Choice ◽  
Recent Progress ◽  
Communication Complexity ◽  
Fair Division ◽  
Approximation Methods ◽  
Challenging Problem ◽  
Computational Perspective

I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide items fairly and efficiently. This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity.

Bipolar Abstract Argumentation with Dual Attacks and Supports

2020 ◽  
Author(s):  
Nico Potyka
Keyword(s):  
Computational Complexity ◽  
Decision Problems ◽  
Abstract Argumentation ◽  
Stable Semantics ◽  
Support Relations ◽  
Support Relationships ◽  
Computational Properties ◽  
Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Sign in / Sign up

Export Citation Format

Share Document