標題: Titlebook: Algorithmic Decision Theory; 4th International Co Toby Walsh Conference proceedings 2015 Springer International Publishing Switzerland 2015 [打印本頁] 作者: opioid 時間: 2025-3-21 19:47
書目名稱Algorithmic Decision Theory影響因子(影響力)
書目名稱Algorithmic Decision Theory影響因子(影響力)學科排名
書目名稱Algorithmic Decision Theory網絡公開度
書目名稱Algorithmic Decision Theory網絡公開度學科排名
書目名稱Algorithmic Decision Theory被引頻次
書目名稱Algorithmic Decision Theory被引頻次學科排名
書目名稱Algorithmic Decision Theory年度引用
書目名稱Algorithmic Decision Theory年度引用學科排名
書目名稱Algorithmic Decision Theory讀者反饋
書目名稱Algorithmic Decision Theory讀者反饋學科排名
作者: 不朽中國 時間: 2025-3-21 20:48
Nested Timed Automata with Invariantsropose an alternative definition of P-trees, and formally introduce their compact representation that exploits occurrences of identical subtrees. We show that P-trees generalize lexicographic preference trees and are strictly more expressive. We relate P-trees to answer-set optimization programs and作者: 流利圓滑 時間: 2025-3-22 03:07 作者: 仇恨 時間: 2025-3-22 07:24 作者: Esalate 時間: 2025-3-22 09:00 作者: 生存環(huán)境 時間: 2025-3-22 15:56
Lecture Notes in Computer Sciencey 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作者: Overthrow 時間: 2025-3-22 19:49 作者: 陳舊 時間: 2025-3-22 21:26
Teng Long,Xingtao Ren,Qing Wang,Chao Wang 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作者: tackle 時間: 2025-3-23 01:31
Teng Long,Xingtao Ren,Qing Wang,Chao Wangation (IVI) has recently been proposed by Weng and Zanuttini (2013). This solving method, which interweaves elicitation and optimization phases, computes a (near) optimal policy without knowing the precise reward values. The procedure as originally presented can be improved in order to reduce the nu作者: parallelism 時間: 2025-3-23 08:09 作者: 支形吊燈 時間: 2025-3-23 13:37 作者: 膽汁 時間: 2025-3-23 15:34 作者: 書法 時間: 2025-3-23 21:35
Weidi Sun,Xiaoyong Xue,Yuteng Lu,Meng SunChoquet integral w.r.t a 2-additive capacity. A cardinal information is a preferential information provided by a Decision Maker (DM) containing a strict preference, a quaternary and indifference relations. Our work is focused on the representation of a cardinal information by a particular Choquet in作者: GIBE 時間: 2025-3-24 00:47 作者: 脾氣暴躁的人 時間: 2025-3-24 06:16
Algorithmic Decision Theory978-3-319-23114-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: BUCK 時間: 2025-3-24 08:12 作者: airborne 時間: 2025-3-24 14:23
978-3-319-23113-6Springer International Publishing Switzerland 2015作者: 投射 時間: 2025-3-24 17:14
Toby WalshUp-to-date results.Includes supplementary material: 作者: 天氣 時間: 2025-3-24 21:56 作者: 無動于衷 時間: 2025-3-25 02:53
Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loopements, constraint optimization, and logic formalisms. The choice of one model over another is usually based on the assumption that it can accurately describe the preferences of humans or other subjects/processes in the considered setting and is computationally tractable. Verification of these prefe作者: ELUDE 時間: 2025-3-25 04:16 作者: 昏迷狀態(tài) 時間: 2025-3-25 11:34 作者: nominal 時間: 2025-3-25 13:10
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 時間: 2025-3-25 16:08 作者: 吃掉 時間: 2025-3-25 20:08
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 時間: 2025-3-26 02:27
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作者: 可耕種 時間: 2025-3-26 06:41
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作者: 博識 時間: 2025-3-26 09:23 作者: 小官 時間: 2025-3-26 14:53 作者: vertebrate 時間: 2025-3-26 17:27 作者: 切割 時間: 2025-3-26 22:05
Geometry on the Utility Spaceel the preferences of an agent in a situation of uncertainty. We focus on the case where the model is neutral with respect to the available options, i.e. treats them, ., as being symmetrical from one another. Specifically, we prove that the only Riemannian metric that respects the geometrical proper作者: Truculent 時間: 2025-3-27 01:37
MOPIC Properties in the Representation of Preferences by a 2-Additive Choquet IntegralChoquet integral w.r.t a 2-additive capacity. A cardinal information is a preferential information provided by a Decision Maker (DM) containing a strict preference, a quaternary and indifference relations. Our work is focused on the representation of a cardinal information by a particular Choquet in作者: 免費 時間: 2025-3-27 06:02 作者: 偽書 時間: 2025-3-27 10:39
Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loopistaking correlation for causality, or testing data in a context that is different from the one where the data were produced. Human experiments need to be done carefully and we advocate a multi-disciplinary research environment that includes experimental psychologists and AI researchers. We argue th作者: 固定某物 時間: 2025-3-27 16:07
Learning the Parameters of a Non Compensatory Sorting Modelf the model, we substitute additive weights by a capacity to represent the power of coalitions of criteria. This corresponds to the Non-Compensatory Sorting model characterized by Bouyssou and Marchant. In the paper we describe a mixed integer program and a heuristic algorithm that enable to learn t作者: Oratory 時間: 2025-3-27 20:45
-Agent Sufficiency for Multiagent Stochastic Physical Search Problemsltiagent systems ignores the question of how many agents should actually be used to solve a problem. To investigate this question, we introduce the condition of .-agent sufficiency for a multiagent optimization problem, which means that an optimal solution exists that requires only . agents. We show作者: Dorsal-Kyphosis 時間: 2025-3-28 01:34 作者: 最初 時間: 2025-3-28 04:33 作者: 斗爭 時間: 2025-3-28 09:50
MC/DC Test Cases Generation Based on?BDDsf the model, we substitute additive weights by a capacity to represent the power of coalitions of criteria. This corresponds to the Non-Compensatory Sorting model characterized by Bouyssou and Marchant. In the paper we describe a mixed integer program and a heuristic algorithm that enable to learn t作者: 有害處 時間: 2025-3-28 11:21
Lecture Notes in Computer Scienceltiagent systems ignores the question of how many agents should actually be used to solve a problem. To investigate this question, we introduce the condition of .-agent sufficiency for a multiagent optimization problem, which means that an optimal solution exists that requires only . agents. We show作者: Induction 時間: 2025-3-28 18:32 作者: 調整校對 時間: 2025-3-28 20:19 作者: 藕床生厭倦 時間: 2025-3-29 00:56
Lecture Notes in Computer Sciencebility..For each of these approaches, we analyse the computational complexity involved in finding a desired assignment. Particular focus is laid on two natural special cases of agents? preferences which allow for positive complexity results.作者: fluffy 時間: 2025-3-29 06:08
Nested Timed Automata with Invariants where the manipulation problem turns from . to .-hard. Compared to the classical notion of single-peakedness, notions of nearly single-peakedness are more robust and thus more likely to appear in real-world data sets.作者: Diatribe 時間: 2025-3-29 11:13
Teng Long,Xingtao Ren,Qing Wang,Chao Wango some queries can enable to resolve some other queries, (3) queries can be avoided by using heuristic information to guide the process. Following these ideas, a modified IVI algorithm is presented and experimental results show a significant decrease in the number of queries issued.作者: 可以任性 時間: 2025-3-29 13:01
Group Activity Selection from Ordinal Preferencesbility..For each of these approaches, we analyse the computational complexity involved in finding a desired assignment. Particular focus is laid on two natural special cases of agents? preferences which allow for positive complexity results.作者: 易怒 時間: 2025-3-29 18:38 作者: Chromatic 時間: 2025-3-29 20:59 作者: 使困惑 時間: 2025-3-30 02:55
0302-9743 ional Conference on Algorithmic Decision Theory , ADT 2015, held in September 2015 in Lexington, USA. The 32 full papers presented were carefully selected from 76 submissions. The papers are organized in topical sections such as preferences; manipulation, learning and other issues; utility and decis作者: Aspirin 時間: 2025-3-30 04:31 作者: 鐵砧 時間: 2025-3-30 09:26
Lecture Notes in Computer Sciencehe definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.作者: Instrumental 時間: 2025-3-30 15:19 作者: 會議 時間: 2025-3-30 17:02
Complexity of Manipulative Actions When Voting with Tieshe definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.作者: DEI 時間: 2025-3-30 21:55 作者: BINGE 時間: 2025-3-31 04:01 作者: Mercurial 時間: 2025-3-31 06:52 作者: 集合 時間: 2025-3-31 11:24
Reasoning with Preference Trees over Combinatorial Domains possibilistic logic theories. Finally, we study reasoning with P-trees and establish computational complexity results for the key reasoning tasks of comparing outcomes with respect to orders defined by P-trees, and of finding optimal outcomes.作者: 開頭 時間: 2025-3-31 14:28
