找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: fitful
41#
發(fā)表于 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.
42#
發(fā)表于 2025-3-28 21:18:11 | 只看該作者
43#
發(fā)表于 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.
44#
發(fā)表于 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
45#
發(fā)表于 2025-3-29 10:39:24 | 只看該作者
46#
發(fā)表于 2025-3-29 13:50:34 | 只看該作者
47#
發(fā)表于 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.
48#
發(fā)表于 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].
49#
發(fā)表于 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].
50#
發(fā)表于 2025-3-30 07:28:50 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 15:58
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
贵南县| 张掖市| 阳东县| 大新县| 鹰潭市| 南汇区| 南昌县| 江西省| 资溪县| 南城县| 延吉市| 昌都县| 石棉县| 五莲县| 巴林左旗| 宁安市| 承德市| 金昌市| 确山县| 吴忠市| 鹿邑县| 新源县| 柳州市| 惠安县| 宜兰县| 徐闻县| 互助| 泰宁县| 临武县| 静宁县| 宽甸| 宁德市| 洪江市| 资阳市| 沿河| 科技| 苏州市| 潮州市| 民勤县| 商洛市| 皮山县|