AFTD Auto-Formalizing Theoretical Domains

Game

structureimported Lean

A finite two-player game with $M$ row actions and $N$ column actions, specified by a row utility function $u_r : \mathrm{Fin}\,M \times \mathrm{Fin}\,N \to \mathbb{R}$ and a column utility function $u_c : \mathrm{Fin}\,M \times \mathrm{Fin}\,N \to \mathbb{R}$. Both players are utility maximizers.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BigOperators in
structure Game (M N : ℕ)
Defined in
TCSlib, `Game`
Lean proof
By Karim Abdel Sadek, Mark Bedaywi, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Karim Abdel Sadek and Mark Bedaywi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Used by 12

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BigOperators in
/-- A finite two-player game with `M` row actions and `N` column actions, specified by separate utility functions for the row and column players. Both players are maximizers. [Rou13-L13, §3.1]. Deviation: the source's games are cost-minimization games; here both players maximize. -/
structure Game (M N : ℕ) where
  /-- The row player's utility at the action profile `(i, j)`. -/
  rowUtility : Fin M → Fin N → ℝ
  /-- The column player's utility at the action profile `(i, j)`. -/
  colUtility : Fin M → Fin N → ℝ
See it in the graphDiscuss this resultChallenge it