Combinatorial games under auction play
From MaRDI portal
Publication:1294037
DOI10.1006/game.1998.0676zbMath0949.91001OpenAlexW1987197791MaRDI QIDQ1294037
Andrew J. Lazarus, Daniel E. Loeb, Walter R. Stromquist, Daniel H. Ullman, James Propp
Publication date: 10 December 2000
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/833b7e9c93c175ab3b9c280cf7b2b1e9c8b878eb
2-person games (91A05) Discrete-time games (91A50) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Combinatorial games (91A46)
Related Items (18)
Absolutely minimizing Lipschitz extensions and infinity harmonic functions on the Sierpinski gasket ⋮ Bidding mechanisms in graph games ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Absolutely minimal Lipschitz extension of tree-valued mappings ⋮ Unnamed Item ⋮ Discrete Richman-bidding scoring games ⋮ Bidding games and efficient allocations ⋮ Bidding chess ⋮ Biased tug-of-war, the biased infinity Laplacian, and comparison with exponential cones ⋮ Unnamed Item ⋮ A policy iteration algorithm for zero-sum stochastic games with mean payoff ⋮ Uniqueness of the fixed point of nonexpansive semidifferentiable maps ⋮ Tug-of-war and the infinity Laplacian ⋮ A Survey of Bidding Games on Graphs (Invited Paper) ⋮ Vector-valued optimal Lipschitz extensions ⋮ Infinite-Duration Bidding Games ⋮ ON MAX–MIN MEAN VALUE FORMULAS ON THE SIERPINSKI GASKET
Cites Work
This page was built for publication: Combinatorial games under auction play