Titlebook: Algorithmic Decision Theory; 4th International Co Toby Walsh Conference proceedings 2015 Springer International Publishing Switzerland 2015

ELUDE

昏迷状态

nominal

Towards Decision Making via Expressive Probabilistic Ontologieswicz in 2008. Using this framework, we can model artificial agents in decision-making situation, wherein background knowledge, available alternatives and weighted attributes are represented via probabilistic ontologies. It turns out that extending traditional utility theory with such description log

LURE

吃掉

Manipulation and Bribery When Aggregating Ranked Preferencesy a set of optimal outcomes rather than a single winning outcome. We assume that preferences may be ranked (differ in importance), and we use the Pareto principle adjusted to the case of ranked preferences as the preference aggregation rule. For two important classes of preferences, representing the

Ambiguous

Complexity of Manipulative Actions When Voting with Tiesn practice voters may have preferences with ties. We study the complexity of manipulative actions on elections where voters can have ties, extending the definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both i

可耕种

Bayesian Network Structure Learning with Messy Inputs: The Case of Multiple Incomplete Datasets and input multiple partially overlapping datasets with missing data along with expert opinions about the structure of the model and produces an associated directed acyclic graph representing the graphical layer of a Bayesian network. We provide experimental results where we compare our algorithm with a

博识

小官

vertebrate