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”

Bribery Can Get Harder in Structured Multiwinner Approval Election

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00366978" target="_blank" >RIV/68407700:21240/23:00366978 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.5555/3545946.3598831" target="_blank" >https://doi.org/10.5555/3545946.3598831</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5555/3545946.3598831" target="_blank" >10.5555/3545946.3598831</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bribery Can Get Harder in Structured Multiwinner Approval Election

  • Original language description

    We study the complexity of constructive bribery in the context of structured multiwinner approval elections. Given such an election, we ask whether a certain candidate can join the winning committee by adding, deleting, or swapping approvals, where each such action comes at a cost and we are limited by a budget. We assume our elections to either have the candidate interval or the voter interval property, and we require the property to hold also after the bribery. While structured elections usually make manipulative attacks significantly easier, our work also shows examples of the opposite behavior. We conclude by presenting preliminary insights regarding the destructive variant of our problem.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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/GA22-19557S" target="_blank" >GA22-19557S: New Frontiers in Computational Social Choice</a><br>

  • Continuities

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

Others

  • Publication year

    2023

  • 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

  • Article name in the collection

    Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023

  • ISBN

    978-1-4503-9432-1

  • ISSN

    1548-8403

  • e-ISSN

    1558-2914

  • Number of pages

    9

  • Pages from-to

    1725-1733

  • Publisher name

    IFAAMAS

  • Place of publication

    County of Richland

  • Event location

    Londýn

  • Event date

    May 29, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article