暂无分享,去创建一个
[1] Yongjie Yang,et al. How Hard Is Bribery with Distance Restrictions? , 2016, ECAI.
[2] Jeffrey A. Gottfried,et al. News use across social media platforms 2016 , 2016 .
[3] Toby Walsh,et al. Controlling Elections by Replacing Candidates or Votes , 2015, AAMAS.
[4] Amin Karbasi,et al. Gradient Methods for Submodular Maximization , 2017, NIPS.
[5] N. Yang,et al. Twitter Adoption in Congress , 2010 .
[6] Gábor Erdélyi,et al. The complexity of bribery and control in group identification , 2017, Autonomous Agents and Multi-Agent Systems.
[7] Jörg Rothe,et al. Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules , 2015, Math. Soc. Sci..
[8] Sarit Kraus,et al. Adapting the Social Network to Affect Elections , 2015, AAMAS.
[9] Piotr Faliszewski,et al. Llull and Copeland Voting Computationally Resist Bribery and Constructive Control , 2009, J. Artif. Intell. Res..
[10] Bo An,et al. Optimal defense against election control by deleting voter groups , 2018, Artif. Intell..
[11] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[12] Noga Alon,et al. Optimizing budget allocation among channels and influencers , 2012, WWW.
[13] Jan Vondrák,et al. Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[14] Ted Brader,et al. Striking a Responsive Chord: How Political Ads Motivate and Persuade Voters by Appealing to Emotions , 2005 .
[15] Hong Liu,et al. Parameterized computational complexity of control problems in voting systems , 2009, Theor. Comput. Sci..
[16] Wei Chen,et al. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.
[17] Piotr Faliszewski,et al. Opinion Diffusion and Campaigning on Society Graphs , 2018, IJCAI.
[18] Ken-ichi Kawarabayashi,et al. Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm , 2014, ICML.
[19] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[20] Andreas Krause,et al. Stochastic Submodular Maximization: The Case of Coverage Functions , 2017, NIPS.
[21] Takuro Fukunaga,et al. Threshold Influence Model for Allocating Advertising Budgets , 2015, ICML.
[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] Bryan Wilder,et al. Equilibrium Computation and Robust Optimization in Zero Sum Games With Submodular Structure , 2017, AAAI.
[24] Piotr Faliszewski,et al. Elections with Few Voters: Candidate Control Can Be Easy , 2014, AAAI.
[25] Stefano DellaVigna,et al. The Fox News Effect: Media Bias and Voting , 2006 .
[26] Piotr Faliszewski,et al. Multimode Control Attacks on Elections , 2009, IJCAI.
[27] Piotr Faliszewski,et al. Large-Scale Election Campaigns: Combinatorial Shift Bribery , 2015, AAMAS.
[28] M. Gentzkow,et al. Social Media and Fake News in the 2016 Election , 2017 .
[29] Elad Hazan,et al. Introduction to Online Convex Optimization , 2016, Found. Trends Optim..
[30] Dean S. Karlan,et al. Does the Media Matter? A Field Experiment Measuring the Effect of Newspapers on Voting Behavior and Political Opinions , 2006 .
[31] Stefanie Jegelka,et al. Robust Budget Allocation Via Continuous Submodular Functions , 2017, Applied Mathematics & Optimization.
[32] David G. Rand,et al. Prior Exposure Increases Perceived Accuracy of Fake News , 2018, Journal of experimental psychology. General.
[33] Weiwei Wu,et al. Protecting Elections with Minimal Resource Consumption , 2017, AAMAS.
[34] Amin Karbasi,et al. Online Continuous Submodular Maximization , 2018, AISTATS.
[35] Yevgeniy Vorobeychik,et al. Controlling Elections through Social Influence , 2018, AAMAS.
[36] Edith Elkind,et al. Manipulating Opinion Diffusion in Social Networks , 2017, IJCAI.
[37] Edith Hemaspaandra,et al. More Natural Models of Electoral Control by Partition , 2014, ADT.