Card-Based Computation in the Virtual Player Simulation Model

• URL: http://arxiv.org/abs/2609.02716v1
• Date: Wed, 02 Sep 2026 15:24:28 GMT
• Title: Card-Based Computation in the Virtual Player Simulation Model
• Abstract summary: We study generic card-based computation in the virtual player simulation model.<n>We present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand.<n>We also present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Player simulation has recently emerged as a new direction in card-based cryptography, with protocols developed for simulating virtual players in physical card games such as Old Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.

Related papers

• TCG-AR: Real-Time Multi-View Augmented Reality for Trading Card Game Streaming [18.287539397902417]
  TCG-AR is a novel real-time pipeline that augments trading card games using ordinary RGB cameras alone.<n>Our pipeline detects, orients, and identifies the cards on the board.<n>It can additionally compose a broadcaststyle view that summarizes the game state for spectators.
  arXiv  Detail & Related papers  (2026-07-02T12:29:45Z)
• Parametric Open Source Games [78.29352305480285]
  We introduce parametric open-source games, a continuous analogue of program equilibria.<n>We derive an exact coupling threshold at which selfish gradient ascent in symmetric $2times2$ games switches from defection toward cooperation.<n>We extend the framework to a neural semantics class whose first-order cooperation condition is governed by the ratio of cross-player to self-player sensitivity.
  arXiv  Detail & Related papers  (2026-06-25T14:14:24Z)
• Multi-agent imitation learning with function approximation: Linear Markov games and beyond [63.14746189846806]
  We present the first theoretical analysis of multi-agent imitation learning (MAIL) in linear Markov games.<n>We show that it is possible to replace the state-action level "all policy deviation concentrability coefficient" with a concentrability coefficient defined at the feature level.<n>We propose a deep MAIL interactive algorithm which clearly outperforms BC on games such as Tic-Tac-Toe and Connect4.
  arXiv  Detail & Related papers  (2026-02-26T09:50:15Z)
• Single-Shuffle Full-Open Card-Based Protocols for Any Function [4.039245878626346]
  A textitsingle-shuffle full-open protocol is a minimal model of card-based secure computation.<n>We prove for the first time that every function admits a single-shuffle full-open protocol.
  arXiv  Detail & Related papers  (2025-10-20T08:52:23Z)
• Model as a Game: On Numerical and Spatial Consistency for Generative Games [117.36098212829766]
  We revisit the paradigm of generative games to explore what truly constitutes a Model as a Game (MaaG) with a well-developed mechanism.<n>Based on the DiT architecture, we design two specialized modules: (1) a numerical module that integrates a LogicNet to determine event triggers, with calculations processed externally as conditions for image generation; and (2) a spatial module that maintains a map of explored areas, retrieving location-specific information during generation and linking new observations to ensure continuity.
  arXiv  Detail & Related papers  (2025-03-27T05:46:15Z)
• Simulating Virtual Players for UNO without Computers [0.0]
  We propose a protocol that can simulate virtual players using only physical cards.<n>Our protocol can uniformly select a valid card to play from each virtual player's hand at random.<n>The protocol can also be applied to simulate virtual players in other turn-based card or tile games.
  arXiv  Detail & Related papers  (2025-02-09T18:37:31Z)
• Quantization of Two- and Three-player Cooperative Games Based on QRA [0.0]
  The framework of Clifford algebra is used to perform necessary computations. We study how entanglement, representing the level of pre-agreement between players, affects the final distribution of utility.
  arXiv  Detail & Related papers  (2023-10-27T11:30:53Z)
• Promptable Game Models: Text-Guided Game Simulation via Masked Diffusion Models [68.85478477006178]
  We present a Promptable Game Model (PGM) for neural video game simulators. It allows a user to play the game by prompting it with high- and low-level action sequences. Most captivatingly, our PGM unlocks the director's mode, where the game is played by specifying goals for the agents in the form of a prompt. Our method significantly outperforms existing neural video game simulators in terms of rendering quality and unlocks applications beyond the capabilities of the current state of the art.
  arXiv  Detail & Related papers  (2023-03-23T17:43:17Z)
• Representation Learning for General-sum Low-rank Markov Games [63.119870889883224]
  We study multi-agent general-sum Markov games with nonlinear function approximation. We focus on low-rank Markov games whose transition matrix admits a hidden low-rank structure on top of an unknown non-linear representation.
  arXiv  Detail & Related papers  (2022-10-30T22:58:22Z)
• Principal Trade-off Analysis [79.16635054977068]
  We show "Principal Trade-off Analysis" (PTA), a decomposition method that embeds games into a low-dimensional feature space. PTA represents an arbitrary two-player zero-sum game as the weighted sum of pairs of 2D feature planes. We demonstrate the validity of PTA on a quartet of games (Kuhn poker, RPS+2, Blotto, and Pokemon)
  arXiv  Detail & Related papers  (2022-06-09T18:16:28Z)
• Evolutionary Approach to Collectible Card Game Arena Deckbuilding using Active Genes [1.027974860479791]
  In the arena game mode, before each match, a player has to construct his deck choosing cards one by one from the previously unknown options. We propose a variant of the evolutionary algorithm that uses a concept of an active gene to reduce the range of the operators only to generation-specific subsequences of the genotype.
  arXiv  Detail & Related papers  (2020-01-05T22:46:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.