Sciweavers

2025 search results - page 172 / 405
» Theory as Game: Designing the Game Game
Sort
View
IPL
2006
92views more  IPL 2006»
15 years 6 months ago
A constructive approach to sequential Nash equilibria
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...
René Vestergaard
ICASSP
2011
IEEE
14 years 10 months ago
A cross-layer optimization for energy-efficient MAC protocol with delay and rate constraints
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...
Haksub Kim, Hyungkeuk Lee, Sanghoon Lee
CGA
2006
15 years 6 months ago
Unscripted Narrative for Affectively Driven Characters
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...
Ruth Aylett, Sandy Louchart, João Dias, Ana...
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
16 years 1 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
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...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
16 years 1 months ago
Better with Byzantine: Manipulation-Optimal Mechanisms
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...
Abraham Othman, Tuomas Sandholm