3946 search results - page 117 / 790 » The computational complexity of choice sets |
160
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
180
click to vote
MAAMAW
1993
Springer
15 years 10 months ago
1993
Springer
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
207
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
163
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
171
click to vote
CODES
2007
IEEE
16 years 25 days ago
2007
IEEE
The design and analysis of today’s complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applyin...