A Class of Sequential Games

DOI10.1287/opre.19.2.270zbMath0234.90067OpenAlexW1968141842MaRDI QIDQ5643820

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)

Related Items (11)

Involutions under Bruhat order and labeled Motzkin paths ⋮ Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness ⋮ Pareto optimal matchings of students to courses in the presence of prerequisites ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ A note on the undercut procedure ⋮ Comparing algorithms for fair allocation of indivisible items with limited information ⋮ On fairness via picking sequences in allocation of indivisible goods ⋮ Strategy-proofness of scoring allocation correspondences for indivisible goods ⋮ How to decompose a permutation into a pair of labeled Dyck paths by playing a game ⋮ Computing a small agreeable set of indivisible items ⋮ A duality principle for selection games

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