Cheating by groups and cheating over time in surplus sharing problems

Pfingsten A


Abstract
It is shown that it is less difficult to prevent cheating by groups in surplus sharing problems than to prevent intertemporal cheating by single agents. In passing, a new characterisation of equal (absolute) sharing is provided. (C) 1998 Elsevier Science B.V. All rights reserved.

Keywords
cheating; surplus sharing



Publication type
Research article (journal)

Peer reviewed
Yes

Publication status
Published

Year
1998

Journal
MATHEMATICAL SOCIAL SCIENCES

Volume
36

Issue
3

Start page
243

End page
249

Language
English

ISSN
0165-4896