N-Person Cake-Cutting: There May Be No Perfect Division

Author： Brams Steven J. Jones Michael A. Klamler Christian

Publisher： Mathematical Association of America

ISSN： 1930-0972

Source： American Mathematical Monthly, Vol.120, Iss.1, 2013-01, pp. : 35-47

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cone Concavity and Multiple-Payoff Constrained n-Person Games

By Li S.X.

Journal of Optimization Theory and Applications, Vol. 97, Iss. 1, 1998-04 ,pp. : 119-149

Springer Publishing Company

Access to resources Recommend Favorite

On the existence of almost-pure-strategy Nash equilibrium in n -person finite games

By Połowczuk Wojciech Więcek Piotr Radzik Tadeusz

Mathematical Methods of Operations Research, Vol. 65, Iss. 1, 2007-02 ,pp. : 141-152

Springer Publishing Company

Access to resources Recommend Favorite

n-Person Second-Order Games: A Paradigm Shift in Game Theory

By Larbani M. Yu P.

Journal of Optimization Theory and Applications, Vol. 149, Iss. 3, 2011-06 ,pp. : 447-473

Springer Publishing Company

Access to resources Recommend Favorite

A near equitable 2-person cake cutting algorithm

By Cechlárová Katarína Pillárová Eva

Optimization, Vol. 61, Iss. 11, 2012-11 ,pp. : 1321-1330

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Perfect k-Matchings

By Lu Hongliang Wang Wei

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 229-235

Springer Publishing Company

Access to resources Recommend Favorite