SIGECOM
2010
ACM
13 years 11 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
13 years 11 months ago
2010
ACM
SIGECOM
2010
ACM
13 years 11 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
13 years 11 months ago
2010
ACM
We study the emergence of cooperation in dynamic, anonymous social networks, such as in online communities. We examine prisoner’s dilemma played under a social matching protocol...
SIGECOM
2010
ACM
14 years 28 days 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 ...
SIGECOM
2010
ACM
14 years 28 days ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
SIGECOM
2010
ACM
14 years 28 days ago
2010
ACM
SIGECOM
2010
ACM
14 years 5 months ago
2010
ACM
In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious ...
SIGECOM
2010
ACM
14 years 5 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
SIGECOM
2010
ACM
14 years 5 months ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...