找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Internet and Network Economics; First International Xiaotie Deng,Yinyu Ye Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 20

[复制链接]
楼主: implicate
发表于 2025-3-23 11:04:04 | 显示全部楼层
发表于 2025-3-23 15:16:33 | 显示全部楼层
发表于 2025-3-23 20:23:28 | 显示全部楼层
发表于 2025-3-23 23:52:21 | 显示全部楼层
发表于 2025-3-24 04:51:12 | 显示全部楼层
发表于 2025-3-24 06:57:48 | 显示全部楼层
发表于 2025-3-24 12:17:19 | 显示全部楼层
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions,o as to maximize the sum of the utilities of the players (i.e., the social welfare). In the case when the utility of each player is a monotone submodular function, we prove that there is no polynomial time approximation algorithm which approximates the maximum social welfare by a factor better than
发表于 2025-3-24 18:11:19 | 显示全部楼层
New Algorithms for Mining the Reputation of Participants of Online Auctions,omer e-commerce. Confident reputation rating system is an important factor in managing risk and building customer satisfaction. Unfortunately, most online auction sites employ a very simple reputation rating scheme that utilizes user feedbacks and comments issued after committed auctions. Such schem
发表于 2025-3-24 22:31:58 | 显示全部楼层
发表于 2025-3-25 00:09:01 | 显示全部楼层
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances,icipant is interested in only one subset of commodities. Chen et al. [5] showed that it is NP-hard to decide the existence of a Walrasian equilibrium for a single-minded auction and proposed a notion of approximate Walrasian equilibrium called relaxed Walrasian equilibrium. We show that every single
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-16 06:54
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表