Reducing complexity in winner determination for combinatorial ascending auctions

Publisher： Elsevier

ISSN： 1567-4223

Source： Electronic Commerce Research and Applications, Vol.2, Iss.2, 2003-06, pp. : 176-186

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions

By Mito Masaya Fujita Satoshi

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 507-523

Springer Publishing Company

Access to resources Recommend Favorite

Combinatorial auctions

By Abrache Jawad

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 131-164

Springer Publishing Company

Access to resources Recommend Favorite

Design issues for combinatorial auctions

By Abrache Jawad

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 2, Iss. 1, 2004-03 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

Combinatorial interpretation of Kolmogorov complexity

By Romashchenko A. Shen A. Vereshchagin N.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 111-123

Elsevier

Access to resources Recommend Favorite

Experimenting with Proxy Agents in Online Combinatorial Auctions

International Journal of Intelligent Information Technologies (IJIIT), Vol. 10, Iss. 2, 2014-04 ,pp. : 56-75

IGI Global_journal

Access to resources Recommend Favorite