Abstract
We consider settings were agents are faced with several possible opportunities and need to choose one. Each opportunity may offer a different utility to the agent, and determining this utility may consume resources. The underlying costly exploration problem is termed “economic search”, though its essence is different from the traditional search notion in artificial intelligence (e.g. BFS, IDDFA, and A*), as there is no underlying combinatorial structure to the opportunities. We study the effects that search costs can have on individual and aggregate utility in distributed multi-agent economic-search settings. Traditionally, in such setting, search costs are regarded as a market inefficiency, and, as such, as something to be avoided or reduced to a minimum. We show, in contrast, that in many search settings, the introduction of search costs can actually improve the aggregate social welfare, or even the expected utility of each and every individual agent.We note that the proceeds from the search costs are assumed to be wasted, with no one directly benefiting from them. We demonstrate the benefits of search costs in both one-sided and two-sided search settings, using standard, classical models from economic-search theory. For the designers of multiagent systems, the results imply that deliberate (and potentially artificial) increase of search costs should be considered as possible means to improving the system’s overall performance.
Original language | English |
---|---|
Pages (from-to) | 297-329 |
Number of pages | 33 |
Journal | Annals of Mathematics and Artificial Intelligence |
Volume | 72 |
Issue number | 3-4 |
DOIs | |
State | Published - Nov 2014 |
Keywords
- Matching
- Multi-agent systems
- Search
- Search costs
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Applied Mathematics