找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Web and Internet Economics; 11th International C Evangelos Markakis,Guido Sch?fer Conference proceedings 2015 Springer-Verlag Berlin Heidel

[復(fù)制鏈接]
41#
發(fā)表于 2025-3-28 17:15:52 | 只看該作者
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing,blem of welfare maximization; we apply this to compute an approximately core stable solution that extracts one-fourth of the optimal social welfare for the class of subadditive valuations. We also show much stronger results for several popular sub-classes: anonymous, fractionally subadditive, and su
42#
發(fā)表于 2025-3-28 19:23:46 | 只看該作者
43#
發(fā)表于 2025-3-29 00:23:59 | 只看該作者
44#
發(fā)表于 2025-3-29 05:58:44 | 只看該作者
45#
發(fā)表于 2025-3-29 10:21:13 | 只看該作者
46#
發(fā)表于 2025-3-29 12:01:41 | 只看該作者
47#
發(fā)表于 2025-3-29 17:21:17 | 只看該作者
Online Allocation and Pricing with Economies of Scale,fficiently produce such an allocation with cost at most a constant factor greater than the minimum over such allocations in hindsight, so long as the marginal costs do not decrease too rapidly. We also give a bicriteria approximation to social welfare for the case of more general valuation functions
48#
發(fā)表于 2025-3-29 21:28:26 | 只看該作者
Ad Exchange: Envy-Free Auctions with Mediators, We develop a game-theoretic model for the entanglement of the . auction at the ad exchange with the . auctions at the ad networks. We consider the incentives of all three involved parties and suggest a ., an extension of the Walrasian equilibrium that ensures envy-freeness for all participants. We
49#
發(fā)表于 2025-3-30 02:12:36 | 只看該作者
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Costo show that the problem of computing a Nash equilibrium in Shapley network cost sharing games is .-complete even in undirected graphs, where previous hardness results where known only in the directed case.
50#
發(fā)表于 2025-3-30 07:39:38 | 只看該作者
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction,ality. We prove this bicriteria guarantee is asymptotically (almost) tight..Finally, we examine what strategies are required to ensure individual rationality in the SMRA with general valuation functions. First, we provide a weak characterization, namely ., for individual rationality. We then show th
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 07:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
花莲市| 安西县| 徐汇区| 磐石市| 保康县| 宁化县| 林口县| 汶上县| 芒康县| 买车| 琼中| 安徽省| 平远县| 佛山市| 湖南省| 苍山县| 葫芦岛市| 乌海市| 来安县| 拉萨市| 连州市| 河北省| 龙门县| 台中县| 双牌县| 永嘉县| 长宁县| 凉城县| 钦州市| 灵丘县| 大理市| 达拉特旗| 汝南县| 贵南县| 松阳县| 镇平县| 木里| 曲麻莱县| 靖安县| 诏安县| 江源县|