標題: Titlebook: Algorithmic Decision Theory; Third International Patrice Perny,Marc Pirlot,Alexis Tsoukiàs Conference proceedings 2013 Springer-Verlag Ber [打印本頁] 作者: Extraneous 時間: 2025-3-21 18:02
書目名稱Algorithmic Decision Theory影響因子(影響力)
書目名稱Algorithmic Decision Theory影響因子(影響力)學科排名
書目名稱Algorithmic Decision Theory網(wǎng)絡公開度
書目名稱Algorithmic Decision Theory網(wǎng)絡公開度學科排名
書目名稱Algorithmic Decision Theory被引頻次
書目名稱Algorithmic Decision Theory被引頻次學科排名
書目名稱Algorithmic Decision Theory年度引用
書目名稱Algorithmic Decision Theory年度引用學科排名
書目名稱Algorithmic Decision Theory讀者反饋
書目名稱Algorithmic Decision Theory讀者反饋學科排名
作者: 光滑 時間: 2025-3-21 22:01 作者: 虛弱 時間: 2025-3-22 00:51 作者: 不感興趣 時間: 2025-3-22 05:51
Yu Peng,Shuling Wang,Naijun Zhan,Lijun Zhangiple scenarios. Our approach is an adaptation of a linear programming model that solves a Pydxp6g4roblem of coverage, also called “set covering”, by selecting the optimal mix of elements from the bank of the available scheduling patterns.作者: Atheroma 時間: 2025-3-22 12:31
0302-9743 edings of the Third International Conference on Algorithmic Decision Theory, ADT 2013, held in November 2013 in Bruxelles, Belgium. The 33 revised full papers presented were carefully selected from more than 70 submissions, covering preferences in reasoning and decision making, uncertainty and robus作者: 羽飾 時間: 2025-3-22 14:05
Lecture Notes in Computer Science the number of parents a node may have. The learned CP-net is guaranteed to be consistent with the original CP-net on all queries from the learning process. We tested the algorithm on randomly generated CP-nets; the learned CP-nets agree with the originals on a high percent of non-training preference comparisons.作者: 態(tài)度暖昧 時間: 2025-3-22 20:47
https://doi.org/10.1007/b102376tive in solving the . and the . problems for instances of practical sizes. To this end, we propose encodings of the two problems as answer-set programs, design methods to generate LP tree votes randomly to support experiments, and present experimental results obtained with ASP solvers . and ..作者: NATAL 時間: 2025-3-22 22:52
Learning CP-net Preferences Online from User Queries, the number of parents a node may have. The learned CP-net is guaranteed to be consistent with the original CP-net on all queries from the learning process. We tested the algorithm on randomly generated CP-nets; the learned CP-nets agree with the originals on a high percent of non-training preference comparisons.作者: contrast-medium 時間: 2025-3-23 01:47
Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers,tive in solving the . and the . problems for instances of practical sizes. To this end, we propose encodings of the two problems as answer-set programs, design methods to generate LP tree votes randomly to support experiments, and present experimental results obtained with ASP solvers . and ..作者: effrontery 時間: 2025-3-23 08:23
Yuteng Lu,Kaicheng Shao,Weidi Sun,Meng Sunutions from the computational complexity perspective. Then, we address the problem from one agent’s point of view. In particular, we propose algorithms suggesting to an agent how to sequence its own tasks in order to optimize its own objective function, regardless of the other agents objectives.作者: 同來核對 時間: 2025-3-23 13:00 作者: phlegm 時間: 2025-3-23 15:16 作者: GROWL 時間: 2025-3-23 20:39
https://doi.org/10.1007/b102376e find that the stochastic nature of the retweeting decision contributes to a large amount of uncertainty. However, the genetic algorithm is able to increase the scale on which a message is being retweeted significantly.作者: 和音 時間: 2025-3-24 00:15
Two Agents Competing for a Shared Machine,utions from the computational complexity perspective. Then, we address the problem from one agent’s point of view. In particular, we propose algorithms suggesting to an agent how to sequence its own tasks in order to optimize its own objective function, regardless of the other agents objectives.作者: 開頭 時間: 2025-3-24 03:42
How to Put through Your Agenda in Collective Binary Decisions,rther natural parameters and study their influence on the computational complexity of both problems, thereby providing both tractability and intractability results. Furthermore, we provide tight combinatorial bounds on the worst-case size of an accepted ballot in terms of the number of voters.作者: Affluence 時間: 2025-3-24 07:39 作者: 宮殿般 時間: 2025-3-24 11:31 作者: Corporeal 時間: 2025-3-24 16:37 作者: 喃喃而言 時間: 2025-3-24 20:13 作者: orient 時間: 2025-3-24 23:39
Planning System for Emergency Services,iple scenarios. Our approach is an adaptation of a linear programming model that solves a Pydxp6g4roblem of coverage, also called “set covering”, by selecting the optimal mix of elements from the bank of the available scheduling patterns.作者: FATAL 時間: 2025-3-25 05:50 作者: callous 時間: 2025-3-25 08:05
Lecture Notes in Computer Science that the inferred bipolar Choquet integral is consistent with the given examples as much as possible. Furthermore, since the elicitation process we study has many relationships with problems in statistical machine learning, we also present the links between our models and concepts developed in the latter field.作者: Generosity 時間: 2025-3-25 12:13
Ben Moszkowski,Dimitar P. Guelevthe shape of this probability distribution empirically, for the impartial culture assumption. We study variants of the problem where the number of candidates approved by each voter is upper and/or lower bounded. We generalize some of our results to multiwinner approval voting.作者: somnambulism 時間: 2025-3-25 18:50
https://doi.org/10.1007/978-3-319-25942-0ces over properties of arguments, and change as the result of moving to different motivational states. We also provide a dialogical proof theory that establishes whether there exists some motivational state in which an argument is accepted.作者: 只有 時間: 2025-3-25 22:46
Christoph Splei?,Gerald Kunzmannionally easy and require little information to be performed. We prove convergence of iterative voting rules when restricted manipulation is allowed, and we present experiments showing that iterative restricted manipulation yields a positive increase in the Condorcet efficiency and Borda score for a number of standard voting rules.作者: FIN 時間: 2025-3-26 01:48 作者: Morose 時間: 2025-3-26 04:59 作者: daredevil 時間: 2025-3-26 09:22
Property-Based Preferences in Abstract Argumentation,ces over properties of arguments, and change as the result of moving to different motivational states. We also provide a dialogical proof theory that establishes whether there exists some motivational state in which an argument is accepted.作者: OUTRE 時間: 2025-3-26 14:09 作者: 攀登 時間: 2025-3-26 18:35
Conference proceedings 2013eld in November 2013 in Bruxelles, Belgium. The 33 revised full papers presented were carefully selected from more than 70 submissions, covering preferences in reasoning and decision making, uncertainty and robustness in decision making, multi-criteria decision analysis and optimization, collective 作者: 高深莫測 時間: 2025-3-27 00:47
Two Agents Competing for a Shared Machine,ks in successive steps to an external coordinator, who sequences them according to a known priority rule. We introduce the problem for three different shop configurations, namely when the agents’ parts are transferred to the machine through two distinct linear conveyor belts, when they are transferr作者: 高興去去 時間: 2025-3-27 03:37 作者: initiate 時間: 2025-3-27 08:56 作者: hyperuricemia 時間: 2025-3-27 11:04 作者: Gerontology 時間: 2025-3-27 15:28
Possible Winners in Approval Voting,e say about the possible (co-)winners? The outcome depends on the number of candidates each voter will approve. Whereas it is easy to know who can be a unique winner, we show that deciding whether a set of at least two candidates can be the set of co-winners is computationally hard. If, in addition,作者: 大喘氣 時間: 2025-3-27 21:44
Computational Aspects of Manipulation and Control in Judgment Aggregation,manipulation, we in particular consider incomplete judgment sets and the notions of top-respecting and closeness-respecting preferences introduced by Dietrich and List [13]. This complements previous work on the complexity of manipulation in judgment aggregation that focused on Hamming-distance-indu作者: 搖擺 時間: 2025-3-27 23:38
Property-Based Preferences in Abstract Argumentation,ative strength or from values promoted by the arguments. An underexposed aspect in these models is change of preferences. We present a dynamic model of preferences in argumentation, centering on what we call property-based AFs. It is based on Dietrich and List’s model of property-based preference an作者: Slit-Lamp 時間: 2025-3-28 02:45 作者: accessory 時間: 2025-3-28 08:15 作者: photophobia 時間: 2025-3-28 10:29 作者: Yourself 時間: 2025-3-28 17:06 作者: 珍奇 時間: 2025-3-28 19:36 作者: Offbeat 時間: 2025-3-29 02:12 作者: 一再困擾 時間: 2025-3-29 06:06 作者: 帽子 時間: 2025-3-29 11:01
Learning CP-net Preferences Online from User Queries,solute CP-net learning algorithm: if a preference order can be represented as a CP-net, our algorithm learns a CP-net in time ., where . is a bound on the number of parents a node may have. The learned CP-net is guaranteed to be consistent with the original CP-net on all queries from the learning pr作者: Seizure 時間: 2025-3-29 14:47 作者: indigenous 時間: 2025-3-29 17:15 作者: 違法事實 時間: 2025-3-29 20:58 作者: savage 時間: 2025-3-30 03:24
Patrice Perny,Marc Pirlot,Alexis TsoukiàsUp-to-date results.State-of-the-art research.Fast-track conference proceedings作者: 不能仁慈 時間: 2025-3-30 06:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152921.jpg作者: 充足 時間: 2025-3-30 11:16 作者: penance 時間: 2025-3-30 16:27
Burak Emir,Sebastian Maneth,Martin Oderskyms can be characterised, designed, chosen or justified. The framework shows that 5 features are necessary and sufficient in order to completely describe the whole set of existing methods. It also explains why optimisation remains the general approach under which decision problems are algorithmically considered.作者: FLUSH 時間: 2025-3-30 20:03
Didier Buchs,Luis Pedro,Levi Lúciortain about the current state of the world and thus about the effect that the chosen action would have. Each voter has preferences about what state they would like to see reached once the action has been executed. That is, we need to integrate two kinds of aggregation: beliefs regarding the current state and preferences regarding the next state.作者: 口訣 時間: 2025-3-31 00:02 作者: 微不足道 時間: 2025-3-31 02:25 作者: 大量 時間: 2025-3-31 06:28 作者: 母豬 時間: 2025-3-31 10:42
Qingguo Xu,Robert de Simone,Julien DeAntonicepted or rejected. Each voter supports a certain subset of the proposals–the . of this voter–and opposes the remaining ones. He accepts a ballot if he supports more than half of the proposals in this ballot. The task is to decide whether there exists a ballot approving a set of selected proposals (作者: 完整 時間: 2025-3-31 13:23
Xuandong Li,Zhiming Liu,Wang Yi problem in the lexicographic ordering approach (LO). Like all multicriteria optimization methods, the LO method has the criteria order parameter that should be fixed carefully. Indeed, the criteria usually conflict with each other, and thus, finding an appropriate order between the criteria is chal作者: Rotator-Cuff 時間: 2025-3-31 20:56
Ben Moszkowski,Dimitar P. Gueleve say about the possible (co-)winners? The outcome depends on the number of candidates each voter will approve. Whereas it is easy to know who can be a unique winner, we show that deciding whether a set of at least two candidates can be the set of co-winners is computationally hard. If, in addition,作者: BLAND 時間: 2025-3-31 22:42
https://doi.org/10.1007/978-3-319-25942-0manipulation, we in particular consider incomplete judgment sets and the notions of top-respecting and closeness-respecting preferences introduced by Dietrich and List [13]. This complements previous work on the complexity of manipulation in judgment aggregation that focused on Hamming-distance-indu作者: 澄清 時間: 2025-4-1 05:08
https://doi.org/10.1007/978-3-319-25942-0ative strength or from values promoted by the arguments. An underexposed aspect in these models is change of preferences. We present a dynamic model of preferences in argumentation, centering on what we call property-based AFs. It is based on Dietrich and List’s model of property-based preference an作者: Fallibility 時間: 2025-4-1 06:59
Towards Verified Faithful Simulationike UTA*, ACUTA or UTA-GMS for learning utility functions to rank a set of alternatives assume that decision maker(s) are able to provide fully reliable training data in the form of e.g. pairwise preferences. In this paper we relax this assumption by attaching a likelihood degree to each ordered pai作者: 字的誤用 時間: 2025-4-1 13:55 作者: 討人喜歡 時間: 2025-4-1 15:06
