Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Abstraction and approximate decision-theoretic planning
Artificial Intelligence
Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
Towards a universal test suite for combinatorial auction algorithms
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
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Tabu Search
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Some Economics of Market-Based Distributed Scheduling
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A market-based approach to resource allocation in manufacturing
A market-based approach to resource allocation in manufacturing
Optimal Investment in Knowledge Within a Firm Using a Market Mechanism
Management Science
Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market
Information Systems Research
Multirobot Task Assignment in Active Surveillance
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
| Hi-index | 0.00 |
The primary advantage of using simulated internal markets to solve complex resource allocation problems is that markets permit much of the computation of a solution to be distributed over a large number independent agents running on separate processors. The difficulty that arises in the context of NP-hard resource allocation problems is that the market for resources inevitably takes the form of a combinatorial auction, which induces a different type of NP-hard problem. We examine an important class of stochastic, intrafirm resource allocation problems and ask whether economic constructs, such as agents, markets, and prices, provide a useful foundation for structuring decentralized heuristic solution techniques. We show how complex exchange protocols can help market-based search techniques avoid the local maxima problems associated with other greedy search heuristics and converge on good equilibrium solutions.