阐明
发表于 2025-3-23 12:34:14
http://reply.papertrans.cn/16/1530/152924/152924_11.png
biopsy
发表于 2025-3-23 14:54:08
http://reply.papertrans.cn/16/1530/152924/152924_12.png
ALTER
发表于 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.
defile
发表于 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
http://reply.papertrans.cn/16/1530/152924/152924_16.png
绅士
发表于 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.
BIBLE
发表于 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.
progestin
发表于 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
http://reply.papertrans.cn/16/1530/152924/152924_20.png