Advertisement

Coping with Selfish On-Going Behaviors

  • Orna Kupferman
  • Tami Tamir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6355)

Abstract

A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from the one corresponding to the real behavior of the environment. The system may cope with cheating by charging penalties to cheats it detects. In this paper, we formalize this setting by means of weighted automata and their resilience to selfish environments. Automata have proven to be a successful formalism for modeling the on-going interaction between a system and its environment. In particular, weighted finite automata (WFAs), which assign a cost to each input word, are useful in modeling an interaction that has a quantitative outcome. Consider a WFA \(\mathcal{A}\) over the alphabet Σ. At each moment in time, the environment may cheat \(\mathcal{A}\) by reporting a letter different from the one it actually generates. A penalty function η:Σ×Σ→IR  ≥ 0 maps each possible false-report to a penalty, charged whenever the false-report is detected. A detection-probability function p:Σ×Σ→[0,1] gives the probability of detecting each false-report. We say that \(\mathcal{A}\) is (η,p)-resilient to cheating if 〈η,p〉 ensures that the minimal expected cost of an input word is achieved with no cheating. Thus, a rational environment has no incentive to cheat \(\mathcal{A}\).

We study the basic problems arising in the analysis of this setting. In particular, we consider the problem of deciding whether a given WFA \(\mathcal{A}\) is (η,p)-resilient with respect to a given penalty function η and a detection-probability function p; and the problem of achieving resilience with minimum resources, namely, given \(\mathcal{A}\) and η, finding the minimal (with respect to ∑  σ,σ η(σ,σ′)·p(σ,σ′)) detection-probability function p, such that \(\mathcal{A}\) is (η,p)-resilient. While for general WFAs both problems are shown to be PSPACE-hard, we present polynomial-time algorithms for deterministic WFAs.

Keywords

Polynomial Time Penalty Function Input Word Polynomial Number Good Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. In: Proc. 20th ACM-SIAM Symp. on Discrete Algorithms, pp. 835–844 (2009)Google Scholar
  2. Chakrabarti, A., Chatterjee, K., Henzinger, T.A., Kupferman, O., Majumdar, R.: Verifying quantitative properties using bound functions. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 50–64. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. Chatterjee, K., Doyen, L., Henzinger, T.: Quantative languages. In: Proc. 17th Annual Conf. of the European Association for Computer Science Logic, pp. 385–400 (2008)Google Scholar
  4. Chvatal, V.: Linear Programming. W.H. Freeman and Company, New York (1983)zbMATHGoogle Scholar
  5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  6. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)zbMATHGoogle Scholar
  7. Eilenberg, S.: Automata, Languages and Machines. Academic Press, San Diego (1974)zbMATHGoogle Scholar
  8. Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Proc. 16th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. LNCS. Springer, Heidelberg (2010)Google Scholar
  9. Henzinger, T.A.: Quantitative generalizations of languages. In: Development in Language Theory, pp. 20–22 (2007)Google Scholar
  10. Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logics and Models of Concurrent Systems. NATO Advanced Summer Institutes, vol. F-13, pp. 477–498. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  11. Khachiyan, L.G.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244, 1093–1096 (1979)MathSciNetzbMATHGoogle Scholar
  12. Krob, D.: The equality problem for rational series with multiplicities in the tropical emiring is undecidable. Journal of Algebra and Computation 4, 405–425 (1994)CrossRefzbMATHGoogle Scholar
  13. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)MathSciNetGoogle Scholar
  14. Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. 31st ACM Symp. on Theory of Computing, pp. 129–140 (1999)Google Scholar
  15. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)CrossRefzbMATHGoogle Scholar
  16. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 179–190 (1989)Google Scholar
  17. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 115–125 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  18. Salomaa, A., Soittola, M.: Automata: Theoretic Aspects of Formal Power Series. Springer, New York (1978)CrossRefzbMATHGoogle Scholar
  19. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1–37 (1994)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Orna Kupferman
    • 1
  • Tami Tamir
    • 2
  1. 1.School of Engineering and Computer ScienceHebrew UniversityJerusalemIsrael
  2. 2.School of Computer ScienceThe Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations