Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
The Michigan Internet AuctionBot: a configurable auction server for human and software agents
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Computationally Manageable Combinational Auctions
Management Science
A declarative approach to business rules in contracts: courteous logic programs in XML
Proceedings of the 1st ACM conference on Electronic commerce
Socially conscious decision-making
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Approaches to winner determination in combinatorial auctions
Decision Support Systems - Special issue on information and computational economics
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Combinatorial auctions for supply chain formation
Proceedings of the 2nd ACM conference on Electronic commerce
An auction-based method for decentralized train scheduling
Proceedings of the fifth international conference on Autonomous agents
Automated negotiation from declarative contract descriptions
Proceedings of the fifth international conference on Autonomous agents
Risk and expectations in a-priori time allocation in multi-agent contracting
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Decision Processes in Agent-Based Automated Contracting
IEEE Internet Computing
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Combinatorial Auction for Collaborative Planning
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Negotiation among self-interested computationally limited agents
Negotiation among self-interested computationally limited agents
Solving combinatorial auctions with temporal constraints in economic agents
Solving combinatorial auctions with temporal constraints in economic agents
Agent-mediated electronic commerce: a survey
The Knowledge Engineering Review
A Multi-Agent Negotiation Testbed for Contracting Tasks with Temporal and Precedence Constraints
International Journal of Electronic Commerce
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Scheduling tasks with precedence constraints to solicit desirable bid combinations
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
Proceedings of the ninth international conference on Electronic commerce
Winner determination for combinatorial auctions for tasks with time and precedence constraints
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Marco Somalvico Memorial Issue
Hi-index | 0.00 |
In this paper we are interested in the decision problem faced by an agent when requesting bids for collections of tasks with complex time constraints and interdependencies. In particular, we study the problem of specifying an appropriate schedule for the tasks in the request for bids. We expect bids to require resource commitments, so we expect different settings of time windows to solicit different bids and different costs. The agent is interested in soliciting “desirable” bids, where desirable means bids that can be feasibly combined in a low-cost combination that covers the entire collection of tasks. Since the request for bids has to be issued before the agent can see any bids, in this decision process there is a probability of loss as well as a probability of gain. This requires the decision process to deal with the risk posture of the person or organization on whose behalf the agent is acting. We describe a model based on Expected Utility Theory and show how an agent can attempt to maximize its profits while managing its financial risk exposure. We illustrate the operation and properties of the model and discuss what assumptions are required for its successful integration in multiagent contracting applications.