能够支付
发表于 2025-3-28 15:51:26
The Computational Complexity of Random Serial Dictatorship,l in the special domain of random assignment where indifferences are unavoidable. While . . is obviously feasible, we show that . the resulting probabilities is #P-complete and thus intractable, both in the context of voting and assignment.
新鲜
发表于 2025-3-28 21:18:11
http://reply.papertrans.cn/103/10217/1021691/1021691_42.png
相互影响
发表于 2025-3-29 02:16:47
Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduldeadline multiplied by a priority weight. Two charging schemes are studied, the . which does not always admit pure Nash equilibria, and the ., which does always admit pure Nash equilibria, at the price of overcharging by a constant factor.
改变立场
发表于 2025-3-29 03:15:47
0302-9743papers were carefully reviewed and selected from 150 submissions and cover research in theoretical computer science, artificial intelligence and microeconomics.978-3-642-45045-7978-3-642-45046-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
exigent
发表于 2025-3-29 10:39:24
http://reply.papertrans.cn/103/10217/1021691/1021691_45.png
恶名声
发表于 2025-3-29 13:50:34
http://reply.papertrans.cn/103/10217/1021691/1021691_46.png
甜瓜
发表于 2025-3-29 18:41:08
Valuation Compressions in VCG-Based Combinatorial Auctions,ions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes.
闪光东本
发表于 2025-3-29 22:44:01
A Protocol for Cutting Matroids Like Cakes,a base of the matroid. If there are up to 8 agents, we show how everyone can ensure that his worst case utility for the resulting base is the same as those given by Markakis and Psomas for the fair allocation of indivisible goods, based on the guarantees of Demko and Hill .
背信
发表于 2025-3-30 03:44:25
A Protocol for Cutting Matroids Like Cakes,a base of the matroid. If there are up to 8 agents, we show how everyone can ensure that his worst case utility for the resulting base is the same as those given by Markakis and Psomas for the fair allocation of indivisible goods, based on the guarantees of Demko and Hill .
SEEK
发表于 2025-3-30 07:28:50
http://reply.papertrans.cn/103/10217/1021691/1021691_50.png