Sciweavers

1653 search results - page 67 / 331
» Computer science and game theory
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 9 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
HICSS
2007
IEEE
93views Biometrics» more  HICSS 2007»
14 years 3 months ago
Making Sense of Stories: the development of a new mobile computer game
This paper analyzes the retrospective stories of a four person team responsible for developing a new computer game for mobile phones. Our theorizing is based on an in-depth, two y...
Patrick Stacey, Andrew Brown, Joe Nandhakumar
ATAL
2001
Springer
14 years 1 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
FOCS
2008
IEEE
14 years 3 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
Ran Raz