 A good example would be a leader election algorithm that selects a computation server within a network.The algorithm specifies that agents should send their total computational power to each other, after which the most powerful agent is chosen as the leader to complete the task.In this algorithm agents may lie about their true computation power because they are potentially in danger of being tasked with CPU-intensive jobs which will reduce their power to complete local jobs.