资源分类
》 资源 》论文》nash equilibria in concurrent games with lexicographic preferences

nash equilibria in concurrent games with lexicographic preferences

2019-11-04 | |  99 |   55 |   0
Abstract We study concurrent games with finite-memory strategies where players are given a Bu?chi and a mean-payoff objective, which are related by a lexicographic order: a player first prefers to satisfy its Bu?chi objective, and then prefers to minimise costs, which are given by a mean-payoff function. In particular, we show that deciding the existence of a strict Nash equilibrium in such games is decidable, even if players’ deviations are implemented as infinite memory strategies.

上一篇：efficient inference and computation of optimal alternatives for preference languages based on lexicographic models

下一篇：symbolic priors for rnn based semantic parsing

用户评价
全部评价

热门资源

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...

  • Shape-based Autom...

    We present an algorithm for automatic detection...