暂无分享,去创建一个
[1] Toby Walsh,et al. Controlling Elections by Replacing Candidates or Votes , 2015, AAMAS.
[2] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[3] Piotr Faliszewski,et al. Elections with Few Voters: Candidate Control Can Be Easy , 2014, AAAI.
[4] Toby Walsh,et al. How Hard Is It to Control an Election by Breaking Ties? , 2013, ECAI.
[5] M. Gentzkow,et al. Social Media and Fake News in the 2016 Election , 2017 .
[6] Ariel D. Procaccia,et al. Complexity of Strategic Behavior in Multi-Winner Elections , 2008, J. Artif. Intell. Res..
[7] Jeffrey A. Gottfried,et al. News use across social media platforms 2016 , 2016 .
[8] Michal Valko,et al. Revealing Graph Bandits for Maximizing Local Influence , 2016, AISTATS.
[9] Ted Brader,et al. Striking a Responsive Chord: How Political Ads Motivate and Persuade Voters by Appealing to Emotions , 2005 .
[10] Hong Liu,et al. Parameterized computational complexity of control problems in voting systems , 2009, Theor. Comput. Sci..
[11] Elchanan Mossel,et al. Majority dynamics and aggregation of information in social networks , 2012, Autonomous Agents and Multi-Agent Systems.
[12] Wei Chen,et al. Combinatorial Multi-Armed Bandit: General Framework and Applications , 2013, ICML.
[13] N. Yang,et al. Twitter Adoption in Congress , 2010 .
[14] Ariel D. Procaccia,et al. Ranked Voting on Social Networks , 2015, IJCAI.
[15] Jörg Rothe,et al. Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules , 2015, Math. Soc. Sci..
[16] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[17] Gábor Erdélyi,et al. The complexity of bribery and control in group identification , 2017, Autonomous Agents and Multi-Agent Systems.
[18] Xiaokui Xiao,et al. Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.
[19] Edith Cohen,et al. Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.
[20] Vincent Conitzer. The maximum likelihood approach to voting on social networks , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[21] Stefano DellaVigna,et al. The Fox News Effect: Media Bias and Voting , 2006 .
[22] Christine B. Williams,et al. Web 2.0 and Politics: The 2008 U.S. Presidential Election and an E-Politics Research Agenda , 2010, MIS Q..
[23] Kate Larson,et al. The Echo Chamber: Strategic Voting and Homophily in Social Networks , 2016, AAMAS.
[24] Reynold Cheng,et al. Online Influence Maximization , 2015, KDD.
[25] Jörg Rothe,et al. Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control , 2008, Math. Log. Q..
[26] David G. Rand,et al. Prior Exposure Increases Perceived Accuracy of Fake News , 2018, Journal of experimental psychology. General.
[27] Svetlana Obraztsova,et al. On manipulation in multi-winner elections based on scoring rules , 2013, AAMAS.
[28] Edith Hemaspaandra,et al. More Natural Models of Electoral Control by Partition , 2014, ADT.
[29] Piotr Faliszewski,et al. Llull and Copeland Voting Computationally Resist Bribery and Constructive Control , 2009, J. Artif. Intell. Res..
[30] Wei Chen,et al. Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.
[31] Jörg Rothe,et al. Anyone but him: The complexity of precluding an alternative , 2005, Artif. Intell..
[32] Svetlana Obraztsova,et al. Optimal Manipulation of Voting Rules , 2012, AAAI.
[33] Vincent Conitzer,et al. When are elections with few candidates hard to manipulate? , 2007, J. ACM.
[34] Pradeep Varakantham,et al. Robust influence Maximization , 2016 .
[35] Bernhard Schölkopf,et al. Influence Maximization in Continuous Time Diffusion Networks , 2012, ICML.
[36] Ray Christensen,et al. Identifying Election Fraud Using Orphan and Low Propensity Voters , 2014 .
[37] Edith Elkind,et al. Manipulating Opinion Diffusion in Social Networks , 2017, IJCAI.
[38] Laks V. S. Lakshmanan,et al. CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.
[39] Piotr Faliszewski,et al. Multimode Control Attacks on Elections , 2009, IJCAI.
[40] S AhlquistJohn,et al. Alien Abduction and Voter Impersonation in the 2012 U.S. General Election: Evidence from a Survey List Experiment , 2014 .
[41] Le Song,et al. Scalable Influence Estimation in Continuous-Time Diffusion Networks , 2013, NIPS.
[42] Piotr Faliszewski,et al. How Hard Is Bribery in Elections? , 2006, J. Artif. Intell. Res..
[43] Yongjie Yang,et al. How Hard Is Bribery with Distance Restrictions? , 2016, ECAI.
[44] Dean S. Karlan,et al. Does the Media Matter? A Field Experiment Measuring the Effect of Newspapers on Voting Behavior and Political Opinions , 2006 .
[45] Nicole Immorlica,et al. Uncharted but not Uninfluenced: Influence Maximization with an Uncertain Network , 2017, AAMAS.