3433 search results - page 14 / 687 » Heuristics for a bidding problem |
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We are interested in mechanisms that maximize social welfare. In [2] this problem was studied for multi-unit auctions and for public project problems, and in each case so...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...