Document Open Access Logo

Games with Trading of Control

Authors Orna Kupferman, Noam Shenwald

PDF
Thumbnail PDF

File

LIPIcs.CONCUR.2023.19.pdf
  • Filesize: 0.98 MB
  • 17 pages

Document Identifiers

Author Details

Orna Kupferman
  • School of Engineering and Computer Science, Hebrew University, Jerusalem, Israel
Noam Shenwald
  • School of Engineering and Computer Science, Hebrew University, Jerusalem, Israel

Funding

Research is funded by the Israel Science Foundation, Grant 2357/19, and the European Research Council, Advanced Grant ADVANSYNT.

Cite As Get BibTex

Orna Kupferman and Noam Shenwald. Games with Trading of Control. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.CONCUR.2023.19

Abstract

The interaction among components in a system is traditionally modeled by a game. In the turned-based setting, the players in the game jointly move a token along the game graph, with each player deciding where to move the token in vertices she controls. The objectives of the players are modeled by ω-regular winning conditions, and players whose objectives are satisfied get rewards. Thus, the game is non-zero-sum, and we are interested in its stable outcomes. In particular, in the rational-synthesis problem, we seek a strategy for the system player that guarantees the satisfaction of the system’s objective in all rational environments. In this paper, we study an extension of the traditional setting by trading of control. In our game, the players may pay each other in exchange for directing the token also in vertices they do not control. The utility of each player then combines the reward for the satisfaction of her objective and the profit from the trading. The setting combines challenges from ω-regular graph games with challenges in pricing, bidding, and auctions in classical game theory. We study the theoretical properties of parity trading games: best-response dynamics, existence and search for Nash equilibria, and measures for equilibrium inefficiency. We also study the rational-synthesis problem and analyze its tight complexity in various settings.

Subject Classification

ACM Subject Classification
  • Theory of computation → Formal languages and automata theory
  • Theory of computation → Logic and verification
Keywords
  • Parity Games
  • Rational Synthesis
  • Game Theory
  • Auctions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 25th Int. Colloq. on Automata, Languages, and Programming, volume 372 of Lecture Notes in Computer Science, pages 1-17. Springer, 1989. Google Scholar
  2. S.V. Albrecht and M.J. Wooldridge. Multi-agent systems research in the united kingdom. AI Commun., 35(4):269-270, 2022. Google Scholar
  3. S. Almagor, U. Boker, and O. Kupferman. Formalizing and reasoning about quality. Journal of the ACM, 63(3):24:1-24:56, 2016. Google Scholar
  4. S. Almagor, D. Kuperberg, and O. Kupferman. Sensing as a complexity measure. Int. J. Found. Comput. Sci., 30(6-7):831-873, 2019. Google Scholar
  5. S. Almagor and O. Kupferman. High-quality synthesis against stochastic environments. In Proc. 25th Annual Conf. of the European Association for Computer Science Logic, volume 62 of LIPIcs, pages 28:1-28:17, 2016. Google Scholar
  6. S. Almagor, O. Kupferman, and G. Perelli. Synthesis of controllable Nash equilibria in quantitative objective game. In Proc. 27th Int. Joint Conf. on Artificial Intelligence, pages 35-41, 2018. Google Scholar
  7. M. Alshiekh, R. Bloem, R. Ehlers, B. Könighofer, S. Niekum, and U. Topcu. Safe reinforcement learning via shielding. In Proc. of 32nd Conf. on Artificial Intelligence, pages 2669-2678. AAAI Press, 2018. Google Scholar
  8. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In Proc. 45th IEEE Symp. on Foundations of Computer Science, pages 295-304. IEEE Computer Society, 2004. Google Scholar
  9. G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Könighofer, and S. Pranger. Run-time optimization for learned controllers through quantitative games. In Proc. 31st Int. Conf. on Computer Aided Verification, volume 11561 of Lecture Notes in Computer Science, pages 630-649. Springer, 2019. Google Scholar
  10. G. Avni, P. Ghorpade, and S. Guha. A game of pawns, 2023. URL: https://arxiv.org/abs/2305.04096.
  11. G. Avni and T.A. Henzinger. An updated survey of bidding games on graphs. In 47th Int. Symp. on Mathematical Foundations of Computer Science, volume 241 of Leibniz International Proceedings in Informatics (LIPIcs), pages 3:1-3:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  12. G. Avni, T.A. Henzinger, and V. Chonev. Infinite-duration bidding games. Journal of the ACM, 66(4):31:1-31:29, 2019. Google Scholar
  13. G. Avni, T.A. Henzinger, and D. Zikelic. Bidding mechanisms in graph games. J. Comput. Syst. Sci., 119:133-144, 2021. Google Scholar
  14. G. Avni, I. Jecker, and D. Zikelic. Infinite-duration all-pay bidding games. In Symposium on Discrete Algorithms, pages 617-636. SIAM, 2021. Google Scholar
  15. G. Avni and O. Kupferman. Synthesis from component libraries with costs. In Proc. 25th Int. Conf. on Concurrency Theory, volume 8704 of Lecture Notes in Computer Science, pages 156-172. Springer, 2014. Google Scholar
  16. BBC. Should billboard advertising be banned? https://www.bbc.com/news/business-62806697, 2022.
  17. R. Bloem, K. Chatterjee, and B. Jobstmann. Graph games and reactive synthesis. In Handbook of Model Checking., pages 921-962. Springer, 2018. Google Scholar
  18. P. Bouyer-Decitre, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning about quality and fuzziness of strategic behaviours. In Proc. 28th Int. Joint Conf. on Artificial Intelligence, pages 1588-1594, 2019. Google Scholar
  19. V. Bruyère. Synthesis of equilibria in infinite-duration games on graphs. ACM SIGLOG News, 8(2):4-29, 2021. Google Scholar
  20. V. Bruyère. A Game-Theoretic Approach for the Synthesis of Complex Systems, pages 52-63. Springer International Publishing, 2022. Google Scholar
  21. K. Chatterjee, T. A. Henzinger, and N. Piterman. Generalized parity games. In Proc. 10th Int. Conf. on Foundations of Software Science and Computation Structures, volume 4423 of Lecture Notes in Computer Science, pages 153-167. Springer, 2007. Google Scholar
  22. K. Chatterjee, R. Majumdar, and T. A. Henzinger. Controller synthesis with budget constraints. In Proc 11th International Workshop on Hybrid Systems: Computation and Control, volume 4981 of Lecture Notes in Computer Science, pages 72-86. Springer, 2008. Google Scholar
  23. S. Chaudhuri, S. Kannan, R. Majumdar, and M.J. Wooldridge. Game theory in AI, logic, and algorithms (dagstuhl seminar 17111). Dagstuhl Reports, 7(3):27-32, 2017. Google Scholar
  24. R. Condurache, E. Filiot, R. Gentilini, and J.-F. Raskin. The complexity of rational synthesis. In Proc. 43th Int. Colloq. on Automata, Languages, and Programming, volume 55 of LIPIcs, pages 121:1-121:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  25. R. Condurache, Y. Oualhadj, and N. Troquard. The Complexity of Rational Synthesis for Concurrent Games. In Proc. 29th Int. Conf. on Concurrency Theory, volume 118 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:15, Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Google Scholar
  26. D. Fisman, O. Kupferman, and Y. Lustig. Rational synthesis. In Proc. 16th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 6015 of Lecture Notes in Computer Science, pages 190-204. Springer, 2010. Google Scholar
  27. O. Kupferman. Examining classical graph-theory problems from the viewpoint of formal-verification methods. In Proc. 49th ACM Symp. on Theory of Computing, page 6, 2017. Google Scholar
  28. O. Kupferman, G. Perelli, and M.Y. Vardi. Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence, 78(1):3-20, 2016. Google Scholar
  29. O. Kupferman and N. Piterman. Lower bounds on witnesses for nonemptiness of universal co-Büchi automata. In Proc. 12th Int. Conf. on Foundations of Software Science and Computation Structures, volume 5504 of Lecture Notes in Computer Science, pages 182-196. Springer, 2009. Google Scholar
  30. O. Kupferman and N. Shenwald. On the complexity of LTL rational synthesis. In Proc. 28th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 13243 of Lecture Notes in Computer Science, pages 25-45, 2022. Google Scholar
  31. Meta. Introduction to the advertising standards. https://transparency.fb.com/policies/ad-standards/, 2023.
  32. J.F. Nash. Equilibrium points in n-person games. In Proceedings of the National Academy of Sciences of the United States of America, 1950. Google Scholar
  33. N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007. Google Scholar
  34. C. H. Papadimitriou. Algorithms, games, and the internet. In Proc. 33rd ACM Symp. on Theory of Computing, pages 749-753, 2001. Google Scholar
  35. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179-190, 1989. Google Scholar
  36. M. Ummels. The complexity of Nash equilibria in infinite multiplayer games. In Proc. 11th Int. Conf. on Foundations of Software Science and Computation Structures, pages 20-34, 2008. Google Scholar
  37. J. von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, 1953. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact