Hypertree Decompositions For Combinatorial Auctions - Optimal Winner Determinati
由……售出:
CN¥429.00
有货
+ CN¥147.49 送货
14天退货政策
付款方式：
产品详情
产品详情
Hypertree Decompositions For Combinatorial Auctions - Optimal Winner Determinati
Combinatorial Auctions Are Auctions In Which Each Bid Can Be Placed On A Set Of Items, As Opposed To Standard Auctions, In Which Each Bid Is Placed On A Single Item. The Winner Determination Problem For Combinatorial Auctions Is Known To Be Np-complete. One Of The Approaches To Cope With The Hardness Of The Problem Is To Identify Tractable Classes Of Combinatorial Auctions By Means Of Hypertree Decompositions.
- 品牌: KS OmniScriptum Publishing
- 类别: 计算机与互联网
-
语言: English
-
作者: EKATERINA LEBEDEVA
-
出版日期: 2008-09-02
-
页数: 80
-
出版社／标签: KS OmniScriptum Publishing
-
格式: Paperback
- Fruugo ID: 557231229-1125500679
- ISBN: 9783639022315
配送
送货
在 24 小时内发货
-
STANDARD: CN¥147.49 - 之间的交付 周二 17 十一月 2026–周二 15 十二月 2026
从 英国 送货。
退货
退货
我们会争取将您订购的产品按照您的规格完整地配送给您。不过，万一您收到不完整的订单，或收到的产品与您订购的不同，或者有其他原因让您对订单不满意，您可以要求全部或部分退货，您将收到相应产品的全额退款。