All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Opinion diffusion and campaigning on society graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10455460" target="_blank" >RIV/00216208:11320/22:10455460 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=bhRgYTyjqr" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=bhRgYTyjqr</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/logcom/exac014" target="_blank" >10.1093/logcom/exac014</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Opinion diffusion and campaigning on society graphs

  • Original language description

    We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network connecting the clusters. Our model can incorporate different campaigning actions, various partitions of the society into clusters and very general diffusion processes. Perhaps surprisingly, we show that computing the cheapest campaign for rigging a given election can usually be done efficiently, even with arbitrarily-many voters. Moreover, we report on computational simulations we have performed to evaluate the quality and efficiency of finding such solutions.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of Logic and Computation

  • ISSN

    0955-792X

  • e-ISSN

    1465-363X

  • Volume of the periodical

    32

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    33

  • Pages from-to

    1162-1194

  • UT code for WoS article

    000771144700001

  • EID of the result in the Scopus database

    2-s2.0-85140791292