Abstract
ABSTRACT In 1945, Bronislaw Knaster proposed a procedure to divide any number of indivisible goods between a finite number of players requiring the players to place monetary values or bids on all of the goods. Often discussed in math for liberal arts courses that concentrate on contemporary applications of mathematics for non-major students, Knaster's procedure provides an opportunity to introduce optimization to students who will never take a course in calculus. A simple analysis of the procedure can lead students to determine optimal monetary bids, given the bids of the other players. More advanced students can explicitly prove these results. The optimization problem naturally leads to pure strategy Nash equilibria of Knaster's procedure when viewed as a game, thereby providing a transition between fair division procedures and game theory that can be used in both math for liberal arts courses and upper level courses.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
