Sciweavers

1662 search results - page 52 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AAAI
2004
13 years 10 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
CATA
2003
13 years 10 months ago
A Restaurant Finder using Belief-Desire-Intention Agent Model and Java Technology
It is becoming more important to design systems capable of performing high-level management and control tasks in interactive dynamic environments. At the same time, it is difficul...
Dongqing Lin, Thomas P. Wiggen, Chang-Hyun Jo
AAAI
2004
13 years 10 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam
CG
2004
Springer
14 years 2 months ago
Strategic Interactions in the TAC 2003 Supply Chain Tournament
The TAC 2003 supply-chaingame presented automated trading agents with a challenging strategic problem. Embedded within a complex stochastic environment was a pivotal strategic deci...
Joshua Estelle, Yevgeniy Vorobeychik, Michael P. W...
BROADNETS
2006
IEEE
14 years 2 months ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage