نتایج جستجو برای: combinatorial auctions
تعداد نتایج: 48897 فیلتر نتایج به سال:
auctions have been as a competitive method of buying and selling valuable or rare items for a long time. single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. nonetheless, this adds the complexity of the auctio...
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
Mechanisms design has traditionally been a manual endeavor. In 2002, Conitzer and Sandholm introduced the automated mechanism design (AMD) approach, where the mechanism is computationally created for the specific problem instance at hand. This has several advantages: 1) it can yield better mechanisms than the ones known to date, 2) it applies beyond the problem classes studied manually to date,...
In combinatorial auctions, a bidder may bid for arbitrary combinations of items, so combinatorial auction can be applied to resource and task allocations in multiagent systems. But determining the winners of combinatorial auctions who maximize the profit of the auctioneer is known to be NP-complete. A branch-and-bound method can be one of efficient methods for the winner determination. In this ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید