软膏 发表于 2025-3-28 16:51:09
http://reply.papertrans.cn/16/1530/152954/152954_41.pngMelatonin 发表于 2025-3-28 20:01:29
http://reply.papertrans.cn/16/1530/152954/152954_42.pngmotor-unit 发表于 2025-3-29 01:39:08
http://reply.papertrans.cn/16/1530/152954/152954_43.pngLIEN 发表于 2025-3-29 05:57:35
http://reply.papertrans.cn/16/1530/152954/152954_44.pngmiracle 发表于 2025-3-29 10:23:14
https://doi.org/10.1007/978-3-319-99660-8Agents; Auction; Cake-cutting; Communication channels (information theory); Complexity; Computer networks朴素 发表于 2025-3-29 14:39:27
http://reply.papertrans.cn/16/1530/152954/152954_46.png低能儿 发表于 2025-3-29 19:03:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152954.jpg改正 发表于 2025-3-29 23:25:25
Algorithmic Game Theory978-3-319-99660-8Series ISSN 0302-9743 Series E-ISSN 1611-3349nepotism 发表于 2025-3-30 01:27:41
Der Aufbau der Kupfer-ZinklegierungenWe consider the online problem in which an intermediary trades identical items with a sequence of . buyers and . sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-from-trade.一再烦扰 发表于 2025-3-30 06:14:33
Online Trading as a Secretary Problem,We consider the online problem in which an intermediary trades identical items with a sequence of . buyers and . sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-from-trade.