Scholarlink

<p>We analyze a simple picking game where two players, Left and Right, pick objects (with certain values assigned to the objects) alternatively, with a bidding variation. Instead of picking objects alternatively, players bid to make a move. We derive a Nash equilibrium with respect to the bids of the players and propose algorithms to maximize the utilities of the players.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Discrete-Bidding Picking Sequence Games

  • 期刊论文

  • 发表日期：

    2025年12月3日

查看全文
  • Ravi Kant Rai

摘要

We analyze a simple picking game where two players, Left and Right, pick objects (with certain values assigned to the objects) alternatively, with a bidding variation. Instead of picking objects alternatively, players bid to make a move. We derive a Nash equilibrium with respect to the bids of the players and propose algorithms to maximize the utilities of the players.