| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5128417 | Operations Research Letters | 2016 | 4 Pages |
Abstract
In opinion formation games with directed graphs, a bounded price of anarchy is only known for weighted Eulerian graphs. Thus, we bound the price of anarchy for a more general class of directed graphs with conditions intuitively meaning that each node does not influence the others more than she is influenced, where the bounds depend on such difference (in a ratio). We also show that there exists an example just slightly violating the conditions with an unbounded price of anarchy.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Po-An Chen, Yi-Le Chen, Chi-Jen Lu,