35 search results - page 3 / 7 » sigecom 2010 |
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We report on a series of highly controlled human subject experiments in networked bargaining. The basic interaction between two players is the decision of how to share a mutual pa...
SIGECOM
2010
ACM
14 years 8 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
SIGECOM
2010
ACM
14 years 8 months ago
2010
ACM
We conduct laboratory experiments on variants of market scoring rule prediction markets, under different information distribution patterns, in order to evaluate the efficiency an...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
SIGECOM
2010
ACM
14 years 9 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...