Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids

We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we focus on a more practical approximated algorithm in the context of revenue maximization. We propose a hill-climbing greedy algorithm, a SA-like random search al...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology : proceedings : 18-22 December, 2006, Hong Kong, China S. 618 - 621
Hauptverfasser:	Fukuta, Naoki, Ito, Takayuki
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 18.12.2006 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	Applied computing > Operations research > Decision analysis Approximation algorithms Computational complexity Computer science Computing methodologies > Artificial intelligence > Distributed artificial intelligence > Cooperation and coordination Computing methodologies > Artificial intelligence > Distributed artificial intelligence > Intelligent agents Consumer electronics Greedy algorithms Indium tin oxide Informatics Information systems > Information systems applications > Decision support systems Information systems > World Wide Web > Online advertising Information systems > World Wide Web > Web applications > Electronic commerce Mathematics of computing > Discrete mathematics > Combinatorics > Combinatorial algorithms Simulated annealing Sorting Temperature
ISBN:	9780769527482, 0769527485
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!