A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents.

Haris Aziz Simon Mackenzie

Published in: CoRR (2016)

Keyphrases

envy free
multi agent systems
multi agent
software agents
resource allocation
communication protocol
decision making
np complete
autonomous agents
cooperative
evolutionary algorithm
state space
incomplete information
pareto optimal
social welfare