找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: LANK
发表于 2025-3-23 12:34:14 | 显示全部楼层
发表于 2025-3-23 14:54:08 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-24 07:32:34 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-25 02:04:27 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-19 18:53
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表