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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology : proceedings : 18-22 December, 2006, Hong Kong, China s. 618 - 621
Hlavní autori:	Fukuta, Naoki, Ito, Takayuki
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Washington, DC, USA IEEE Computer Society 18.12.2006 IEEE
Edícia:	ACM Conferences
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!