827 search results - page 1 / 166 » The Complexity of Probabilistic Lobbying |
ALDT
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
AAAI
2012
11 years 7 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
FCT
2007
Springer
13 years 9 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
UAI
2003
13 years 6 months ago
2003
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
DLOG
2011
12 years 9 months ago
2011
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...