Sciweavers

6881 search results - page 1190 / 1377
» Motivation
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 10 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
177
Voted
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 10 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
165
Voted
CIA
2004
Springer
15 years 10 months ago
Auction Equilibrium Strategies for Task Allocation in Uncertain Environments
Abstract. In this paper we address a model of self interested information agents competing to perform tasks. The agents are situated in an uncertain environment while different tas...
David Sarne, Meirav Hadad, Sarit Kraus
ATAL
2006
Springer
15 years 10 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
ATAL
2006
Springer
15 years 10 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
« Prev « First page 1190 / 1377 Last » Next »