The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Artificial Intelligence 196 (C):1-25 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.
架空名義入札に頑健な複数ユニットオークションプロトコル.櫻井 祐子 横尾 真 - 2002 - Transactions of the Japanese Society for Artificial Intelligence 17:390-397.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,693,354)

6 months
5 (#1,035,700)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations