8437 search results - page 134 / 1688 » Preferences over Sets |
151
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
156
click to vote
LOGCOM
2010
15 years 4 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
141
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
162
click to vote
WCE
2007
15 years 7 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
121
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, GF