A Class of Sequential Games

DOI10.1287/OPRE.19.2.270MaRDI QIDQ5643820zbMATH OpenOpenAlexFDO

Authors David Kohler, R. Chandrasekaran

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.2.270

Mathematics Subject Classification ID

2-person games (91A05)

Cited in

(14)

• Pareto optimal matchings of students to courses in the presence of prerequisites
• Strategy-proofness of scoring allocation correspondences for indivisible goods
• Involutions under Bruhat order and labeled Motzkin paths
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
• Computing a small agreeable set of indivisible items
• On fairness via picking sequences in allocation of indivisible goods
• A duality principle for selection games
• How to decompose a permutation into a pair of labeled Dyck paths by playing a game
• Approximate and strategyproof maximin share allocation of chores with ordinal preferences
• Comparing algorithms for fair allocation of indivisible items with limited information
• Randomized strategyproof mechanisms with best of both worlds fairness and efficiency
• Jérôme Lang's contributions at the interface of economic theory with artificial intelligence
• Axiomatic characterizations of draft rules
• A note on the undercut procedure

This page was built for publication: A Class of Sequential Games

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