伪书
发表于 2025-3-23 12:44:44
http://reply.papertrans.cn/43/4248/424751/424751_11.png
tackle
发表于 2025-3-23 16:25:20
http://reply.papertrans.cn/43/4248/424751/424751_12.png
Blanch
发表于 2025-3-23 18:28:16
W. Doyle Gentry,Michael D. Millerh non-symmetric links. We show an improved upper bound of . on the competitive ratio of a simple greedy algorithm, for any request sequence of . terminals. The result almost matches the lower bound of . (where . is an arbitrarily small constant) due to Faloutsos . and Angelopoulos .
Kaleidoscope
发表于 2025-3-23 22:20:19
http://reply.papertrans.cn/43/4248/424751/424751_14.png
Intruder
发表于 2025-3-24 05:25:19
http://reply.papertrans.cn/43/4248/424751/424751_15.png
crumble
发表于 2025-3-24 10:24:13
C. Eugene Walker,Terri L. Shelton even more efficient mechanisms, but only up to a factor of 2 in the amount of communication needed. We also show that when the players’ valuations for the item are not independently distributed, we cannot do much better than a trivial mechanism.
落叶剂
发表于 2025-3-24 13:07:02
http://reply.papertrans.cn/43/4248/424751/424751_17.png
平息
发表于 2025-3-24 16:29:02
http://reply.papertrans.cn/43/4248/424751/424751_18.png
sperse
发表于 2025-3-24 19:50:42
http://reply.papertrans.cn/43/4248/424751/424751_19.png
hedonic
发表于 2025-3-25 02:51:28
http://reply.papertrans.cn/43/4248/424751/424751_20.png