Titlebook: Algorithmic Game Theory; 11th International S Xiaotie Deng Conference proceedings 2018 Springer Nature Switzerland AG 2018 Agents.Auction.C

只看該作者 · 發(fā)表于 2025-3-29 10:23:14

https://doi.org/10.1007/978-3-319-99660-8Agents; Auction; Cake-cutting; Communication channels (information theory); Complexity; Computer networks

只看該作者 · 發(fā)表于 2025-3-29 14:39:27

只看該作者 · 發(fā)表于 2025-3-29 19:03:28

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152954.jpg

只看該作者 · 發(fā)表于 2025-3-29 23:25:25

Algorithmic Game Theory978-3-319-99660-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

只看該作者 · 發(fā)表于 2025-3-30 01:27:41

Der Aufbau der Kupfer-ZinklegierungenWe consider the online problem in which an intermediary trades identical items with a sequence of . buyers and . sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-from-trade.

只看該作者 · 發(fā)表于 2025-3-30 06:14:33

Online Trading as a Secretary Problem,We consider the online problem in which an intermediary trades identical items with a sequence of . buyers and . sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objectives: welfare and gain-from-trade.

		自動登錄	找回密碼
密碼			To register

關于派博傳思			派博傳思旗下網站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網	吾愛論文網	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經驗總結	SCIENCEGARD	IMPACTFACTOR	派博系數	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-5 23:37
Copyright © 2001-2015 派博傳思京公網安備110108008328 版權所有 All rights reserved