Sciweavers

1662 search results - page 5 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
ATAL
2009
Springer
14 years 2 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CLIMA
2010
13 years 7 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
TSMC
2002
80views more  TSMC 2002»
13 years 7 months ago
Performance metric alerting: a new design approach for complex alerting problems
Alerting systems and related decision-making automation are widely used to enhance the safety and capability of controlled processes across many applications. Traditional alerting ...
L. C. Yang, J. K. Kuchar
TASE
2008
IEEE
13 years 7 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari