Combinatorial games under auction play

DOI10.1006/GAME.1998.0676MaRDI QIDQ1294037zbMATH OpenOpenAlexFDO

Authors Andrew J. Lazarus, Daniel E. Loeb, James Propp, Walter Stromquist, Daniel H. Ullman

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

zbMATH Keywords

combinatorial gamesdirected graphstwo-person gamesauctionimpartial games

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43) Combinatorial games (91A46) Discrete-time games (91A50)

Recommendations

• Bidding mechanisms in graph games
• scientific article
• Discrete Richman-bidding scoring games
• Discrete bidding games
• Infinite-duration poorman-bidding games

Cites work

• scientific article; zbMATH DE number 988850 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 1099355 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• scientific article; zbMATH DE number 3257031 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Minimal vectors of pairs of dual lattices
• Random Walks on Infinite Graphs and Groups - a Survey on Selected topics

Cited in

(25)

• A Survey of Bidding Games on Graphs (Invited Paper)
• Note on an Auction Procedure for a Matching Game in Polynomial Time
• scientific article; zbMATH DE number 7561655 (Why is no real title available?)
• A policy iteration algorithm for zero-sum stochastic games with mean payoff
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• scientific article; zbMATH DE number 7649928 (Why is no real title available?)
• Absolutely minimizing Lipschitz extensions and infinity harmonic functions on the Sierpinski gasket
• Biased tug-of-war, the biased infinity Laplacian, and comparison with exponential cones
• Bidding chess
• \textsc{influence}: a partizan scoring game on graphs
• Vector-valued optimal Lipschitz extensions
• Bidding mechanisms in graph games
• Bidding combinatorial games
• Market Equilibrium for Combinatorial Auctions and the Matching Core of Nonnegative TU Games
• Discrete bidding games
• Uniqueness of the fixed point of nonexpansive semidifferentiable maps
• Discrete Richman-bidding scoring games
• Tug-of-war and the infinity Laplacian
• Discrete infinity Laplace equations on graphs and tug-of-war games
• Bidding games and efficient allocations
• Infinite-duration bidding games
• Infinite-duration poorman-bidding games
• scientific article; zbMATH DE number 988850 (Why is no real title available?)
• On max-min mean value formulas on the Sierpinski gasket
• Absolutely minimal Lipschitz extension of tree-valued mappings

This page was built for publication: Combinatorial games under auction play

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294037)