Combinatorial games under auction play

DOI10.1006/GAME.1998.0676zbMATH Open0949.91001OpenAlexW1987197791MaRDI QIDQ1294037FDOQ1294037

Andrew J. Lazarus, Daniel E. Loeb, Walter 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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Walks on Infinite Graphs and Groups - a Survey on Selected topics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal vectors of pairs of dual lattices

Cited In (21)

• Title not available (Why is that?)
• A policy iteration algorithm for zero-sum stochastic games with mean payoff
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Infinite-Duration Bidding Games
• Bidding chess
• ON MAX–MIN MEAN VALUE FORMULAS ON THE SIERPINSKI GASKET
• Vector-valued optimal Lipschitz extensions
• Bidding mechanisms in graph games
• Market Equilibrium for Combinatorial Auctions and the Matching Core of Nonnegative TU 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 poorman-bidding games
• Note on an Auction Procedure for a Matching Game in Polynomial Time
• A Survey of Bidding Games on Graphs (Invited Paper)
• 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)