Matches in SemOpenAlex for { <https://semopenalex.org/work/W3138927480> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W3138927480 endingPage "395" @default.
- W3138927480 startingPage "379" @default.
- W3138927480 abstract "This work studies the computational complexity of Optimal Lobbying under Threshold Aggregation. Optimal Lobbying is the problem a lobbyist or a campaign manager faces in a voting scenario of a multi-issue referendum when trying to influence the result. The Lobby is faced with a profile that specifies for each voter and each issue whether the voter approves or rejects the issue, and seeks to find the smallest set of voters it can influence to change their vote, for a desired outcome to be obtained. This problem also describes problems arising in other scenarios of aggregation, such as principal-agents incentives scheme in a complex combinatorial problem, and bribery in Truth-Functional Judgement Aggregation. We study cases when the issues are aggregated by a threshold aggregator, that is, an anonymous monotone function, and the desired outcomes set is upward-closed. We analyze this problem with regard to two parameters: the minimal number of supporters needed to pass an issue, and the size of the maximal minterm of the desired set. For these parameters we separate tractable cases from untractable cases and in that generalize the NP-complete result of Christian et al. [8]. We show that for the extreme values of the parameters, the problem is solvable in polynomial time, and provide algorithms. On the other hand, we prove the problem is not solvable in polynomial time for the non-extremal values, which are common values for the parameters." @default.
- W3138927480 created "2021-03-29" @default.
- W3138927480 creator A5069353672 @default.
- W3138927480 date "2015-01-01" @default.
- W3138927480 modified "2023-10-09" @default.
- W3138927480 title "Complexity of Optimal Lobbying in Threshold Aggregation" @default.
- W3138927480 cites W144297625 @default.
- W3138927480 cites W1517036688 @default.
- W3138927480 cites W1985572324 @default.
- W3138927480 cites W2003296459 @default.
- W3138927480 cites W2025738350 @default.
- W3138927480 cites W2032293242 @default.
- W3138927480 cites W2049720957 @default.
- W3138927480 cites W2100229481 @default.
- W3138927480 cites W2109291623 @default.
- W3138927480 cites W2127172185 @default.
- W3138927480 cites W2134628753 @default.
- W3138927480 cites W2151508551 @default.
- W3138927480 cites W2161392628 @default.
- W3138927480 cites W2171945484 @default.
- W3138927480 cites W2294599764 @default.
- W3138927480 cites W2913352891 @default.
- W3138927480 cites W3122990377 @default.
- W3138927480 cites W3123002740 @default.
- W3138927480 cites W4252711114 @default.
- W3138927480 cites W4292230561 @default.
- W3138927480 doi "https://doi.org/10.1007/978-3-319-23114-3_23" @default.
- W3138927480 hasPublicationYear "2015" @default.
- W3138927480 type Work @default.
- W3138927480 sameAs 3138927480 @default.
- W3138927480 citedByCount "6" @default.
- W3138927480 countsByYear W31389274802016 @default.
- W3138927480 countsByYear W31389274802017 @default.
- W3138927480 countsByYear W31389274802019 @default.
- W3138927480 countsByYear W31389274802020 @default.
- W3138927480 crossrefType "book-chapter" @default.
- W3138927480 hasAuthorship W3138927480A5069353672 @default.
- W3138927480 hasConcept C111919701 @default.
- W3138927480 hasConcept C11413529 @default.
- W3138927480 hasConcept C126255220 @default.
- W3138927480 hasConcept C144237770 @default.
- W3138927480 hasConcept C148220186 @default.
- W3138927480 hasConcept C177264268 @default.
- W3138927480 hasConcept C17744445 @default.
- W3138927480 hasConcept C179799912 @default.
- W3138927480 hasConcept C180505990 @default.
- W3138927480 hasConcept C199360897 @default.
- W3138927480 hasConcept C199539241 @default.
- W3138927480 hasConcept C2524010 @default.
- W3138927480 hasConcept C2834757 @default.
- W3138927480 hasConcept C311688 @default.
- W3138927480 hasConcept C33923547 @default.
- W3138927480 hasConcept C41008148 @default.
- W3138927480 hasConcept C520049643 @default.
- W3138927480 hasConcept C94625758 @default.
- W3138927480 hasConceptScore W3138927480C111919701 @default.
- W3138927480 hasConceptScore W3138927480C11413529 @default.
- W3138927480 hasConceptScore W3138927480C126255220 @default.
- W3138927480 hasConceptScore W3138927480C144237770 @default.
- W3138927480 hasConceptScore W3138927480C148220186 @default.
- W3138927480 hasConceptScore W3138927480C177264268 @default.
- W3138927480 hasConceptScore W3138927480C17744445 @default.
- W3138927480 hasConceptScore W3138927480C179799912 @default.
- W3138927480 hasConceptScore W3138927480C180505990 @default.
- W3138927480 hasConceptScore W3138927480C199360897 @default.
- W3138927480 hasConceptScore W3138927480C199539241 @default.
- W3138927480 hasConceptScore W3138927480C2524010 @default.
- W3138927480 hasConceptScore W3138927480C2834757 @default.
- W3138927480 hasConceptScore W3138927480C311688 @default.
- W3138927480 hasConceptScore W3138927480C33923547 @default.
- W3138927480 hasConceptScore W3138927480C41008148 @default.
- W3138927480 hasConceptScore W3138927480C520049643 @default.
- W3138927480 hasConceptScore W3138927480C94625758 @default.
- W3138927480 hasLocation W31389274801 @default.
- W3138927480 hasOpenAccess W3138927480 @default.
- W3138927480 hasPrimaryLocation W31389274801 @default.
- W3138927480 hasRelatedWork W1589381382 @default.
- W3138927480 hasRelatedWork W2015184777 @default.
- W3138927480 hasRelatedWork W2570892890 @default.
- W3138927480 hasRelatedWork W2603387358 @default.
- W3138927480 hasRelatedWork W2767445978 @default.
- W3138927480 hasRelatedWork W2999291290 @default.
- W3138927480 hasRelatedWork W3036238356 @default.
- W3138927480 hasRelatedWork W3092831610 @default.
- W3138927480 hasRelatedWork W961142965 @default.
- W3138927480 hasRelatedWork W962287279 @default.
- W3138927480 isParatext "false" @default.
- W3138927480 isRetracted "false" @default.
- W3138927480 magId "3138927480" @default.
- W3138927480 workType "book-chapter" @default.