Query restart strategies for Web agents
AGENTS '98 Proceedings of the second international conference on Autonomous agents
The Complexity of Optimal Queuing Network Control
Mathematics of Operations Research
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
SETI@home: an experiment in public-resource computing
Communications of the ACM
Eighteenth national conference on Artificial intelligence
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Robust software via agent-based redundancy
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The Knowledge Engineering Review
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
TRAVOS: Trust and Reputation in the Context of Inaccurate Information Sources
Autonomous Agents and Multi-Agent Systems
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Taverna: lessons in creating a workflow environment for the life sciences: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Recovery Policies for Enhancing Web Services Reliability
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Optimizing jobs timeouts on clusters and production grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Flexible service provisioning with advance agreements
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Fault tolerant mechanism design
Artificial Intelligence
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A Meta-scheduler with Auction Based Resource Allocation for Global Grids
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Computing the fault tolerance of multi-agent deployment
Artificial Intelligence
Commitment-based service coordination
International Journal of Agent-Oriented Software Engineering
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Lazy approximation for solving continuous finite-horizon MDPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Towards faster planning with continuous resources in stochastic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Proactive algorithms for job shop scheduling with probabilistic durations
Journal of Artificial Intelligence Research
Computationally feasible VCG mechanisms
Journal of Artificial Intelligence Research
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Flexible procurement of services with uncertain durations using redundancy
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Mechanism Design for Task Procurement with Flexible Quality of Service
SOCASE '09 Proceedings of the AAMAS 2009 International Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering
Scalable mechanism design for the procurement of services with uncertain durations
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Self-healing execution of business processes based on a peer-to-peer service architecture
ARCS'05 Proceedings of the 18th international conference on Architecture of Computing Systems conference on Systems Aspects in Organic and Pervasive Computing
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
In emerging service-oriented systems, such as computational clouds or grids, software agents are able to automatically procure distributed services to complete computational tasks. However, service execution times are often highly uncertain and service providers may have incentives to lie strategically about this uncertainty to win more customers. In this paper, we argue that techniques from the field of artificial intelligence are instrumental to addressing these challenges. To this end, we first propose a new decision-theoretic algorithm that allows a single service consumer agent to procure services for a computational task with a strict deadline. Crucially, this algorithm uses redundancy in a principled manner to mitigate uncertain execution times and maximise the consumer@?s expected utility. We present both an optimal variant that uses a novel branch-and-bound formulation, and a fast heuristic that achieves near-optimal performance. Using simulations, we demonstrate that our algorithms outperform approaches that do not employ redundancy by up to 130% in some settings. Next, as the algorithms require private information about the providers@? capabilities, we show how techniques from mechanism design can be used to incentivise truthfulness. As no existing work in this area deals with uncertain execution times and redundant invocations, we extend the state of the art by proposing a number of payment schemes for these settings. In a detailed analysis, we prove that our mechanisms fulfil a range of desirable economic properties, including incentive compatibility, and we discuss suboptimal variants that scale to realistic settings with hundreds of providers. We show experimentally that our mechanisms extract a high surplus and that even our suboptimal variants typically achieve a high efficiency (95% or more in a wide range of settings).