Skip to main content

Optimality and Equilibrium of Exploration Ratio for Multiagent Learning in Nonstationary Environments

  • Conference paper
  • First Online:
Book cover Multi-Agent Based Simulation XVI (MABS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9568))

Abstract

I investigate relations between total performance of agent societies and relative performance of individual agents with respect to exploration ratio of multiagent learning. The exploration ratio is a key parameter to determine features of multiagent learning in two aspects: as a speed controller of learning in individual agents, and as a reciprocal noise factor for other agents. The investigation figures out trade-off of the two aspects and shows existence of single optimal value of the ratio to minimize the learning errors. I also carried out experiments to compare the performances of agents who use different exploration ratios. The results of the experiments tells existence of equilibrium points to choose the ratio by individual agents. Finally, we discuss the relationship between optimal and equilibrium values of the exploration ratio, which might bring dilemma of selection of the exploration ratio in an evolutionary way.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kaisers, M., Tuyls, K.: Frequency adjusted multi-agent q-learning. In: Proceedings of 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), pp. 309–315, May 2010

    Google Scholar 

  2. Noda, I.: Limitations of simultaneous multiagent learning in nonstationary environments. In: Proceedings of 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2013), pp. 309–314. IEEE, November 2013

    Google Scholar 

  3. Noda, I.: Robustness of optimality of exploration ratio against agent population in multiagent learning for nonstationary environments. In: Multiagent Interaction Without Prior Coordination (Technical report WS-14-09), pp. 28–34. AAAI, July 2014

    Google Scholar 

  4. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)

    Google Scholar 

  5. Tokic, M.: Adaptive \(\epsilon \)-greedy exploration in reinforcement learning based on value differences. In: Dillmann, R., Beyerer, J., Hanebeck, U.D., Schultz, T. (eds.) KI 2010. LNCS, vol. 6359, pp. 203–210. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Tokic, M., Palm, G.: Value-difference based exploration: adaptive control between epsilon-greedy and softmax. In: Bach, J., Edelkamp, S. (eds.) KI 2011. LNCS, vol. 7006, pp. 335–346. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Wunder, M., Littman, M.L., Babes, M.: Classes of multiagent q-learning dynamicswith epsilon-greedy exploration. In: Frnkranz, J., Joachims, T. (eds.) Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 1167–1174. Omnipress (2010). http://www.icml2010.org/papers/191.pdf

Download references

Acknowledgments

This work was supported by JST CREST and JSPS KAKENHI 24300064.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Itsuki Noda .

Editor information

Editors and Affiliations

A Unimodality of Lower Bound

A Unimodality of Lower Bound

Here, the lower bound is denoted as \(\mathcal{L}(\epsilon )\). Also, \(A = \frac{K \tilde{g}_{a}}{T}\) and \(B = \frac{K+1}{K}\) is introduced for the simplicity. So, \(\mathcal{L}\) can be defined as:

$$\begin{aligned} \mathcal{L}(\epsilon )= & {} T\sigma ^2 + A \epsilon ^{-1} + \epsilon N (2 - B \epsilon ) \end{aligned}$$

Because of the definition, \(1 < B \le 2\) is hold.

Lemma A1

\(\frac{\partial \mathcal{L}}{\partial \epsilon }\) is unimodal and convex upward.    \(\square \)

Proof

$$\begin{aligned} \frac{\partial ^2 \mathcal{L}}{\partial \epsilon ^2} = 2 A \epsilon ^{-3} - 2 N B = 0,&\quad&\therefore \epsilon = \root 3 \of {\frac{A}{NB}} \end{aligned}$$

Therefore, \(\frac{\partial \mathcal{L}}{\partial \epsilon }\) has only one extremal value, and is unimodal.

$$\begin{aligned} \frac{\partial ^3 \mathcal{L}}{\partial \epsilon ^3}= & {} - 6 A \epsilon ^{-4} < 0 \end{aligned}$$

Therefore, \(\frac{\partial \mathcal{L}}{\partial \epsilon }\) is convex upward.    \(\blacksquare \)

Lemma A2

Suppose that \(K \ge 3\). If the solution of \(\frac{\partial \mathcal{L}}{\partial \epsilon } = 0\) exists in the range \(0 < \epsilon < \frac{1}{2}\), the following inequality is hold:

$$\begin{aligned} \left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}}> & {} 0 . \end{aligned}$$

   \(\square \)

Proof

Suppose that the solution of \(\frac{\partial \mathcal{L}}{\partial \epsilon } = 0\) is \(\epsilon _0\):

$$\begin{aligned} \left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \epsilon _0} = -A \epsilon _0^{-2} + 2 N - 2 N B \epsilon _0 = 0 ,&\quad&\therefore A = 2 N \epsilon _0^2 (1 - B \epsilon _0) . \end{aligned}$$

Now, let’s consider the value of \(\left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}}\):

$$\begin{aligned} \left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}}= & {} N (\epsilon - \frac{1}{2}) (\epsilon - \epsilon _0^{+}) (\epsilon - \epsilon _0^{-}) \\ \epsilon _0^{\pm }= & {} \frac{-(B-2) \pm \sqrt{-3 (B-2) (B+\frac{2}{3})}}{4 B} . \end{aligned}$$

Because \(K \ge 3\) and \(1 < B \le \frac{4}{3}\) are hold. So, we can get inequalitis, \( \epsilon _0^{-} \le 0 \) and \( \epsilon _0{+} \ge \frac{1}{2}\). Therefore, solutions of \(\left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}} = 0\) exist one in range \(\le 0\) and two in range \(\ge \frac{1}{2}\).

Because \(\left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}}\) is a cubic function of \(\epsilon _0\) and \(0 < \epsilon _0 < \frac{1}{2}\), \(\left. \frac{\partial \mathcal{L}}{\partial \epsilon }\right| _{\epsilon = \frac{1}{2}} > 0\) is hold.    \(\blacksquare \)

Theorem A3

\(\mathcal{L}(\epsilon )\) is monotonically decreasing or is uni-modal and convex downward in the closed interval \([0,\frac{1}{2}]\).    \(\square \)

Proof

Suppose that \(\frac{\partial \mathcal{L}}{\partial \epsilon } = 0\) has a solution in the closed interval \([0,\frac{1}{2}]\). Using Lemmas A1 and A2, we can say that the solution is only one in the interval.

Also, at the limit \(\epsilon \rightarrow 0\), \(\frac{\partial \mathcal{L}}{\partial \epsilon }\) is negative. Therefore, \(\mathcal{L}(\epsilon )\) is uni-modal and convex downward in the closed interval.

If \(\frac{\partial \mathcal{L}}{\partial \epsilon } = 0\) has no solution in the interval \([0,\frac{1}{2}]\), \(\mathcal{L}(\epsilon )\) is monotonically decreasing because \(\frac{\partial \mathcal{L}}{\partial \epsilon }\) is negative.    \(\blacksquare \)

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Noda, I. (2016). Optimality and Equilibrium of Exploration Ratio for Multiagent Learning in Nonstationary Environments. In: Gaudou, B., Sichman, J. (eds) Multi-Agent Based Simulation XVI. MABS 2015. Lecture Notes in Computer Science(), vol 9568. Springer, Cham. https://doi.org/10.1007/978-3-319-31447-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31447-1_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31446-4

  • Online ISBN: 978-3-319-31447-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics