2015
DOI: 10.1016/j.ejor.2014.11.006
|View full text |Cite
|
Sign up to set email alerts
|

Cooperation through social influence

Abstract: We consider a simple and altruistic multiagent system in which the agents are eager to perform a collective task but where their real engagement depends on the willingness to perform the task of other influential agents. We model this scenario by an influence game, a cooperative simple game in which a team (or coalition) of players succeeds if it is able to convince enough agents to participate in the task (to vote in favor of a decision). We take the linear threshold model as the influence model. We show firs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
1
1

Relationship

3
6

Authors

Journals

citations
Cited by 41 publications
(58 citation statements)
references
References 39 publications
(54 reference statements)
0
58
0
Order By: Relevance
“…Here we have a tuple (G, w, f , q, N), where (G, w, f ) is a both vertex and edge-labeled directed graph, N ⊆ V (G) and for any X ⊆ N, X represents a winning coalition if and only if it can spread its influence to at least q vertices in the graph (Molinero et al, 2015b) (see also Riquelme, 2014). It is also known that influence games capture the complete class of simple games and that some simple games require a representation as unweighted influence games with exponential number of vertices.…”
Section: Discussionmentioning
confidence: 99%
“…Here we have a tuple (G, w, f , q, N), where (G, w, f ) is a both vertex and edge-labeled directed graph, N ⊆ V (G) and for any X ⊆ N, X represents a winning coalition if and only if it can spread its influence to at least q vertices in the graph (Molinero et al, 2015b) (see also Riquelme, 2014). It is also known that influence games capture the complete class of simple games and that some simple games require a representation as unweighted influence games with exponential number of vertices.…”
Section: Discussionmentioning
confidence: 99%
“…They solve such intervention problems by exploiting the singular value decomposition of strategic interaction matrices. [54] apply another approach, based on cooperative games, to influence. More precisely, they model an influence game as a cooperative simple game in which a team of agents succeeds if it is able to convince enough agents to participate in the task, e.g., to vote in favor of a decision.…”
Section: Related Literaturementioning
confidence: 99%
“…See the details how to construct an influence game from a simple game, and how to construct a simple game from an influence game, in [18]. Note that there exists a construction such that the influence game which define a simple game just use unweighted influence graphs.…”
Section: Theorem 2 ([18])mentioning
confidence: 99%
“…Each step can be computed in polynomial time whether the simple game Γ is given by either (N, W) or (W m ) (see Theorem 1 in [18]). …”
Section: Theorem 2 ([18])mentioning
confidence: 99%