We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
We propose the energy efficient MAC algorithm in this paper. In the proposed algorithm, each node sets the contention window size with respect to the residual energy, the harvest...
We discuss work carried out at the University of Salford (UK) and INESC-id (Portugal) on the design and implementation of interactive dramas in 3D graphics environments. We presen...
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...