精致 发表于 2025-3-26 21:51:52
Conference proceedings 2023tember 2023. .The 26 full papers included in this book were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: computational aspects and efficiency in games; computational social choice; fair division; matching and mechanism design..Sciatica 发表于 2025-3-27 02:18:44
http://reply.papertrans.cn/16/1530/152943/152943_32.png不安 发表于 2025-3-27 07:43:14
http://reply.papertrans.cn/16/1530/152943/152943_33.pngcollagen 发表于 2025-3-27 12:33:02
http://reply.papertrans.cn/16/1530/152943/152943_34.png彻底检查 发表于 2025-3-27 17:11:31
http://reply.papertrans.cn/16/1530/152943/152943_35.png航海太平洋 发表于 2025-3-27 19:14:51
http://reply.papertrans.cn/16/1530/152943/152943_36.pngaerobic 发表于 2025-3-27 22:44:52
Coordinating Monetary Contributions in Participatory Budgetingypassed if we consider some natural restricted valuations, namely laminar single-minded valuations and symmetric valuations. Our analysis for the former restriction leads to the discovery of a new class of tractable instances for the . problem, a classical problem in combinatorial optimization.大都市 发表于 2025-3-28 03:57:20
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments the Method of Equal Shares) on real-world instances from Pabulib. Using sampling, we quantify the extent to which simple, greedy PB rules are more robust than proportional ones, and we identify three types of (very) non-robust projects in real-world PB instances.犬儒主义者 发表于 2025-3-28 08:50:25
EFX Allocations for Indivisible Chores: Matching-Based Approachtions of all agents except for one are identical ordering, and (iii) the number of agents is three and each agent has a personalized bi-valued cost function. Furthermore, we provide a polynomial time algorithm to find an EFX allocation for each case.FRONT 发表于 2025-3-28 11:23:30
http://reply.papertrans.cn/16/1530/152943/152943_40.png