Increasing threshold search for best-valued agents

This paper investigates search techniques for multi-agent settings in which the most suitable agent, according to given criteria, needs to be found. In particular, it considers the case where the searching agent incurs a cost for learning the value of an agent and the goal is to minimize the expected overall cost of search by iteratively increasing the extent of search. This kind of search is applicable to various domains, including auctions, first responders, and sensor networks. Using an innovative transformation of the extents-based sequence to a probability-based one, the optimal sequence is proved to consist of either a single search iteration or an infinite sequence of increasing search extents. This leads to a simplified characterization of the the optimal search sequence from which it can be derived. This method is also highly useful for legacy economic-search applications, where all agents are considered suitable candidates and the goal is to optimize the search process as a whole. The effectiveness of the method for both best-valued search and economic search is demonstrated numerically using a synthetic environment.

[1]  Wendi B. Heinzelman,et al.  Flooding Strategy for Target Discovery in Wireless Networks , 2003, MSWIM '03.

[2]  G. Stigler.  The Economics of Information , 1961, Journal of Political Economy.

[3]  R. Preston McAfee,et al.  Joint search for several goods , 1984 .

[4]  Paul R. Milgrom,et al.  A theory of auctions and competitive bidding , 1982 .

[5]  Lones Smith,et al.  Frictional Matching Models , 2011 .

[6]  D. Rubenstein,et al.  Flood search under the California Split rule , 2004, Oper. Res. Lett..

[7]  Pierre-Majorique Léger,et al.  Using search theory to determine an applications selection strategy , 2009, Inf. Manag..

[8]  M. Rothschild,et al.  Searching for the Lowest Price When the Distribution of Prices Is Unknown , 1974, Journal of Political Economy.

[9]  J. Bakos.  Reducing buyer search costs: implications for electronic marketplaces , 1997 .

[10]  Richard Gonzalez,et al.  Curvature of the Probability Weighting Function , 1996 .

[11]  S. Lippman,et al.  THE ECONOMICS OF JOB SEARCH: A SURVEY* , 1976 .

[12]  Jing Deng,et al.  On search sets of expanding ring search in wireless networks , 2008, Ad Hoc Networks.

[13]  Steven A. Lippman,et al.  The Economics of Job Search: A Survey: Part I , 1976 .

[14]  Jess Benhabib,et al.  Job Search: The Choice of Intensity , 1983, Journal of Political Economy.

[15]  Rasmus Lentz,et al.  Sorting by search intensity , 2010, J. Econ. Theory.

[16]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[17]  David Sarne,et al.  Expert-mediated search , 2011, AAMAS.

[18]  Sarit Kraus,et al.  Multi-goal economic search using dynamic search structures , 2010, Autonomous Agents and Multi-Agent Systems.

[19]  Randall Wright,et al.  Introduction to Search Theory and Applications , 2010, J. Econ. Theory.

[20]  Wendi B. Heinzelman,et al.  Searching strategies for target discovery in wireless networks , 2007, Ad Hoc Networks.

[21]  Dan Peled,et al.  Duration of offers, price structure, and the gain from search☆ , 1977 .

[22]  Mingyan Liu,et al.  Revisiting the TTL-based controlled flooding search: optimality and randomization , 2004, MobiCom '04.

[23]  Mingyan Liu,et al.  Controlled Flooding Search in a Large Network , 2007, IEEE/ACM Transactions on Networking.

[24]  Samuel P. M. Choi,et al.  Optimal Time-Constrained Trading Strategies for Autonomous Agents , 2000 .

[25]  Mabry Tyson,et al.  An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction , 1985, IJCAI.

[26]  Sarit Kraus,et al.  Collaborative Multi Agent Physical Search with Probabilistic Knowledge , 2009, IJCAI.

[27]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[28]  John McMillan,et al.  Chapter 27 Search , 1994 .

[29]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[30]  Shudong Jin,et al.  Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[31]  Steven A. Lippman,et al.  SELECTING A SELLING INSTITUTION: AUCTIONS VERSUS SEQUENTIAL SEARCH * , 1995 .

[32]  R. Bellman.  An Optimal Search , 1963 .

[33]  J. Rupert J. Gatti,et al.  Multi-Commodity Consumer Search☆ , 1999 .

[34]  Kamesh Munagala,et al.  Energy-efficient monitoring of extreme values in sensor networks , 2006, SIGMOD Conference.

[35]  Thomas S. Ferguson,et al.  Who Solved the Secretary Problem , 1989 .

[36]  Jiming Liu,et al.  Markov Decision Approach for Time-Constrained Trading in Electronic Marketplace , 2002, Int. J. Inf. Technol. Decis. Mak..

[37]  M. Weitzman.  Optimal search for the best alternative , 1978 .

[38]  Shmuel Gal,et al.  A Compound Strategy for Search in the Labor Market , 1981 .

[39]  Jeffrey O. Kephart,et al.  Shopbot Economics , 1999, AGENTS '99.

[40]  Sanjay Jha,et al.  On the Optimization Trade-Offs of Expanding Ring Search , 2004, IWDC.

[41]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[42]  Kenneth Burdett,et al.  The theory of search for several goods , 1981 .

[43]  Anna Kazeykina,et al.  Optimal Strategies for Reviewing Search Results , 2010, AAAI.

[44]  Yuji Shen,et al.  Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search , 2010, Math. Comput. Sci..

[45]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[46]  Kamesh Munagala,et al.  A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).