找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Web and Internet Economics; 9th International Co Yiling Chen,Nicole Immorlica Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

[复制链接]
楼主: fitful
发表于 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 | 显示全部楼层
发表于 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-9743 papers 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
发表于 2025-3-29 10:39:24 | 显示全部楼层
发表于 2025-3-29 13:50:34 | 显示全部楼层
发表于 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 [18] for the fair allocation of indivisible goods, based on the guarantees of Demko and Hill [8].
发表于 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 [18] for the fair allocation of indivisible goods, based on the guarantees of Demko and Hill [8].
发表于 2025-3-30 07:28:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 22:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表