Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330012 
Year of Publication: 
2023
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 14 [Issue:] 2 [Article No.:] 19 [Year:] 2023 [Pages:] 1-15
Publisher: 
MDPI, Basel
Abstract: 
Divide the dollar is a simplified version of a two player bargaining problem game devised by John Nash. The generalized divide the dollar game has 𝑛>2 players. Evolutionary algorithms can be used to evolve individual players for this generalized game but representation-i.e., a genome plus a move or search operator(s)-must be carefully chosen since it affects the search process. This paper proposes an entirely new representation called a demand matrix. Each individual in the evolving population now represents a collection of n players rather than just an individual player. Players use previous outcomes to decide their choices (bids) in the current round. The representation scales linearly with the number of players and the move operator is a variant of an evolution strategy. The results indicate that this proposed representation for the generalized divide the dollar game permits the efficient evolution of large player populations with high payoffs and fair demand sets.
Subjects: 
player representation
bargaining games
divide the dollar
N-player mathematical games
evolution strategies
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.