Sciweavers

4277 search results - page 843 / 856
» On Multiple Linear Approximations
Sort
View
AAAI
2006
13 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
ICAI
2004
13 years 8 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
NIPS
1997
13 years 8 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
ATAL
2010
Springer
13 years 8 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...
ATAL
2010
Springer
13 years 8 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny