找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithmic Decision Theory; First International Francesca Rossi,Alexis Tsoukias Conference proceedings 2009 Springer-Verlag Berlin Heidel

[復(fù)制鏈接]
樓主: LANK
11#
發(fā)表于 2025-3-23 12:34:14 | 只看該作者
12#
發(fā)表于 2025-3-23 14:54:08 | 只看該作者
13#
發(fā)表于 2025-3-23 20:26:28 | 只看該作者
A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theoryrepresentation of profiles and majority outcomes. Within this geometric framework, we show how profile decompositions can be used to derive restrictions on profiles that avoid the paradoxes of majority voting.
14#
發(fā)表于 2025-3-23 22:44:34 | 只看該作者
Manipulating Tournaments in Cup and Round Robin Competitionsgames that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.
15#
發(fā)表于 2025-3-24 04:26:40 | 只看該作者
On Low-Envy Truthful Allocationsdo not minimize envy by characterizing the truthful mechanisms for two players and two items. Also, we present an analysis for uniformly random allocations which are naturally truthful in expectation. These results simplify or improve previous results of Lipton et al.
16#
發(fā)表于 2025-3-24 07:32:34 | 只看該作者
17#
發(fā)表于 2025-3-24 14:33:09 | 只看該作者
The Possible and the Necessary for Multiple Criteria Group Decision problems, and ., being an outranking method applying robust ordinal regression to well known ELECTRE methods. In this way, we obtain corresponding methods for group decision: .-GROUP, .-GROUP and .-GROUP.
18#
發(fā)表于 2025-3-24 17:33:40 | 只看該作者
Preferences in an Open Worldnd examine how this may refine or even reverse the existing preferences. We identify essential changes in the preference order and show that these changes provide a compact representation of preference relations in an open world.
19#
發(fā)表于 2025-3-24 19:49:57 | 只看該作者
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individualsfrom Discrete Optimization. The purpose of our contribution is to link these two research fields: We first define reasonable ways of ranking sets of objects, i.e. candidates, and then develop efficient algorithms for the actual computation of optimal committees. We focus in particular on the running time complexity of the developed algorithms.
20#
發(fā)表于 2025-3-25 02:04:27 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 16:40
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
策勒县| 光山县| 龙泉市| 中超| 八宿县| 保康县| 名山县| 慈溪市| 克什克腾旗| 吴川市| 司法| 石泉县| 双桥区| 佳木斯市| 玛沁县| 池州市| 乌拉特前旗| 安吉县| 象山县| 泸水县| 孙吴县| 广元市| 绍兴市| 巴青县| 黄山市| 吉林省| 黄平县| 迁西县| 谷城县| 犍为县| 托克托县| 宁南县| 万源市| 麟游县| 潞城市| 肥西县| 苏尼特右旗| 新竹市| 武清区| 鄂托克旗| 奉化市|