作者: CHOIR 時(shí)間: 2025-3-21 21:35
Protective and?Nonprotective Subset Sum Games: A Parameterized Complexity Analysise, and the number of different numbers in the input on the complexity of the problem. Second, we consider a further variant of the game, called ., where?Player?. additionally has the goal that Player?. reaches a value of at least?..?In a nutshell, we show that most algorithms for the nonprotective v作者: Pantry 時(shí)間: 2025-3-22 00:45
Non-maximizing Policies that?Fulfill Multi-criterion Aspirations in?Expectationof the evaluation metrics falls into some given convex set, called the aspiration set. Our algorithm guarantees that this task is fulfilled by using simplices to approximate feasibility sets and propagate aspirations forward while ensuring they remain feasible. It has complexity linear in the number作者: FLAGR 時(shí)間: 2025-3-22 04:38 作者: lattice 時(shí)間: 2025-3-22 11:25
Collaborative Information Dissemination with?Graph-Based Multi-Agent Reinforcement Learningmplish cooperative information dissemination, L-DyAN?and HL-DyAN, differing in terms of the information exchanged?among agents. Our experimental results show that our trained policies outperform existing methods, including the state-of-the-art heuristic, in terms of network coverage and communicatio作者: 藥物 時(shí)間: 2025-3-22 13:55 作者: 委派 時(shí)間: 2025-3-22 19:45
Learning Multiple Multicriteria Additive Models from?Heterogeneous Preferencesming based resolution approach to solve?this . problem (PLS). We?also propose a heuristic to deal with large datasets. We study?the performance of both algorithms through experiments using synthetic and?real data.作者: 罐里有戒指 時(shí)間: 2025-3-22 23:26 作者: Antimicrobial 時(shí)間: 2025-3-23 03:57
F. J. Leonberger,J. P. Donnellynvergence. The pursuit of a polynomial-time algorithm for SSGs is an active area of research. This paper?is intended to support such research by making it easier to study?the graphical structure of SSGs. Our contributions are: (1) a generating algorithm for Stopping Games, (2) a proof that the algor作者: AGGER 時(shí)間: 2025-3-23 07:14
https://doi.org/10.1007/978-3-642-97074-0e, and the number of different numbers in the input on the complexity of the problem. Second, we consider a further variant of the game, called ., where?Player?. additionally has the goal that Player?. reaches a value of at least?..?In a nutshell, we show that most algorithms for the nonprotective v作者: objection 時(shí)間: 2025-3-23 13:20 作者: 減去 時(shí)間: 2025-3-23 15:31 作者: Pcos971 時(shí)間: 2025-3-23 21:44 作者: 閃光東本 時(shí)間: 2025-3-23 22:50
Shabbir A. Shahid,Mohammad Zaman,Lee Hengs sacrifice..We show that no fair tournament rule can prevent manipulations when .. We computationally solve for fair and manipulation-resistant tournament rules for . for up to 6 agents. We conjecture and leave as a major open problem that such a tournament rule exists for all .. We analyze the tra作者: 饑荒 時(shí)間: 2025-3-24 02:52
Hang Yu,Zishuo Huang,Yiqun Pan,Weiding Longming based resolution approach to solve?this . problem (PLS). We?also propose a heuristic to deal with large datasets. We study?the performance of both algorithms through experiments using synthetic and?real data.作者: 失誤 時(shí)間: 2025-3-24 10:16 作者: 紅腫 時(shí)間: 2025-3-24 12:47 作者: 金絲雀 時(shí)間: 2025-3-24 17:22 作者: 厭惡 時(shí)間: 2025-3-24 19:46 作者: abracadabra 時(shí)間: 2025-3-25 01:08 作者: Sinus-Rhythm 時(shí)間: 2025-3-25 04:56 作者: Neolithic 時(shí)間: 2025-3-25 11:18 作者: FOR 時(shí)間: 2025-3-25 13:25
Springer Series in Electronics and Photonicstroduces efficient algorithmic approaches to approximate ARA solutions in multi-stage games, covering both sequential and simultaneous settings, through augmented probability simulation. Two examples concerning international piracy and air combat illustrate the proposed methodology.作者: nugatory 時(shí)間: 2025-3-25 18:28 作者: anaphylaxis 時(shí)間: 2025-3-25 21:19 作者: 不成比例 時(shí)間: 2025-3-26 02:54
Michael C. Hamilton,Anthony E. Speziould like?to find a tournament rule that simultaneously satisfies the following desiderata. It must be . (henceforth, CC), meaning it selects as the winner the unique team that beats?all other teams (if one exists). It must also be . for groups of size . at probability . (henceforth, .), meaning that作者: 嬉耍 時(shí)間: 2025-3-26 07:08 作者: 違反 時(shí)間: 2025-3-26 08:34 作者: tenuous 時(shí)間: 2025-3-26 14:25 作者: 咯咯笑 時(shí)間: 2025-3-26 20:00
Springer Series in Electronics and Photonicstroduces efficient algorithmic approaches to approximate ARA solutions in multi-stage games, covering both sequential and simultaneous settings, through augmented probability simulation. Two examples concerning international piracy and air combat illustrate the proposed methodology.作者: 我不怕犧牲 時(shí)間: 2025-3-27 00:27 作者: Bricklayer 時(shí)間: 2025-3-27 04:04
Yuri M. Aliev,Hans Schüter,Antonia Shivarova (ADS) and manned vehicles motivate related decision-support research. This manuscript develops a novel modeling framework based?on adversarial risk analysis focusing on lane-changing maneuvers. An empirical evaluation is provided within a simulated environment serving to validate the modeling appro作者: allude 時(shí)間: 2025-3-27 06:22 作者: 淡紫色花 時(shí)間: 2025-3-27 11:00
https://doi.org/10.1007/978-3-662-61367-2or networks. This?paper introduces a Multi-Agent Reinforcement Learning (MARL) approach as?a significant step forward in achieving more decentralized, efficient, and collaborative information dissemination. We propose a Partially Observable Stochastic Game (POSG) formulation for information dissemin作者: Catheter 時(shí)間: 2025-3-27 17:00
Shabbir A. Shahid,Mohammad Zaman,Lee Hengd between each pair of agents. The winner of a tournament is determined by a . that maps tournaments to probability distributions over the agents. We want these rules to be fair (choose a high-quality agent) and robust to strategic manipulation. Prior work has shown that under minimally fair rules, 作者: 草率男 時(shí)間: 2025-3-27 20:10 作者: 漂泊 時(shí)間: 2025-3-28 01:58
Hang Yu,Zishuo Huang,Yiqun Pan,Weiding Longthod [.]. In this seminal work, an additive piece-wise linear model?is inferred from a learning set composed of pairwise comparisons.?In this setting, the learning set is provided by a single Decision-Maker (DM), and an additive model is inferred to match?the learning set. We extend this framework t作者: Obituary 時(shí)間: 2025-3-28 05:51 作者: 玩忽職守 時(shí)間: 2025-3-28 07:53 作者: ALOFT 時(shí)間: 2025-3-28 13:58
Conference proceedings 2025 NJ, USA, during October 14-16, 2024...The 18 full papers and 8 one-page abstracts presented were carefully selected from 39 submissions.?The papers cover most of the major aspects of algorithmic decision theory, such as preference modeling and elicitation, voting, preference aggregation, fair divis作者: deviate 時(shí)間: 2025-3-28 17:29
Michael C. Hamilton,Anthony E. Speziorovide upper bounds?to its manipulability. Then, we propose a novel tournament rule that?is CC and ., a strict improvement upon the recent?work of?[.] who proposed a CC and . rule. Finally, we initiate the study of reductions among tournament rules.作者: 時(shí)代錯(cuò)誤 時(shí)間: 2025-3-28 21:31 作者: GUMP 時(shí)間: 2025-3-29 01:37
On Approximately Strategy-Proof Tournament Rules for?Collusions of?Size at?Least Threerovide upper bounds?to its manipulability. Then, we propose a novel tournament rule that?is CC and ., a strict improvement upon the recent?work of?[.] who proposed a CC and . rule. Finally, we initiate the study of reductions among tournament rules.作者: Overstate 時(shí)間: 2025-3-29 03:07 作者: Radiculopathy 時(shí)間: 2025-3-29 09:46
Yuri M. Aliev,Hans Schüter,Antonia Shivarovaty assumptions are provided. In so doing, we showcase the potential?for decision theory to manage ADS behavior in heterogeneous traffic. This research also highlights the need for an ADS to prudently balance computational resources between perception and decision tasks.作者: 比喻好 時(shí)間: 2025-3-29 14:26 作者: Microaneurysm 時(shí)間: 2025-3-29 17:45 作者: PANIC 時(shí)間: 2025-3-29 23:07 作者: ANTE 時(shí)間: 2025-3-30 01:08
Michael C. Hamilton,Anthony E. Spezioaracteristic of Liquid Democracy: the right for a voter to change her mind as time goes by. Our work initiates the incorporation of a time-horizon into decision-making problems in Liquid Democracy systems. Our approach, via a computational complexity analysis, exploits concepts and tools from temporal graph theory.作者: 和諧 時(shí)間: 2025-3-30 06:43 作者: 取回 時(shí)間: 2025-3-30 11:16 作者: 里程碑 時(shí)間: 2025-3-30 14:52
0302-9743 e papers cover most of the major aspects of algorithmic decision theory, such as preference modeling and elicitation, voting, preference aggregation, fair division and resource allocation, coalition formation, game theory, and matching..?.978-3-031-73902-6978-3-031-73903-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cultivate 時(shí)間: 2025-3-30 17:48
The Semiclassical Laser Equations,ich aim at electing not only a single winner but a winning committee of candidates. Meir et al.?[.] initiated the investigation of electoral control for multiwinner voting rules, including single nontransferable vote (SNTV) and bloc voting. We study these two rules with respect to control by adding, deleting, or replacing candidates.作者: Infirm 時(shí)間: 2025-3-30 22:25
Complexity of?Candidate Control for?Single Nontransferable Vote and?Bloc Votingr voters with the goal of either making a favorite candidate win or precluding a despised candidate’s victory. Much work has been done on the computational complexity of controlling elections for single-winner voting rules, yet much less work on the control complexity for multiwinner voting rules wh作者: CHASM 時(shí)間: 2025-3-31 02:11 作者: arthrodesis 時(shí)間: 2025-3-31 07:55 作者: Needlework 時(shí)間: 2025-3-31 11:20
As Time Goes By: Adding a?Temporal Dimension to?Resolve Delegations in?Liquid Democracyl Choice. A concern that has been raised by practitioners is that the current academic literature focuses solely on static inputs, concealing a key characteristic of Liquid Democracy: the right for a voter to change her mind as time goes by. Our work initiates the incorporation of a time-horizon int
