• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Complexity of Control by Adding or Deleting Edges in Graph-Restricted Weighted Voting Games.

Joanna KaczmarekJörg RotheNimrod Talmon
Published in: ECAI (2023)
Keyphrases
  • directed acyclic graph
  • computational complexity
  • worst case
  • multiagent systems
  • coalition formation
  • coalitional games
  • np hard
  • upper bound
  • image registration