Inferring rankings using constrained sensing
We consider the problem of recovering a function over the space of permutations (or, the symmetric group) over n elements from given partial information; the partial information we consider is related to the group theoretic Fourier Transform of the function. This problem naturally arises in several...
Main Author: | Jagabathula, Srikanth |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73523 https://orcid.org/0000-0003-0737-3259 |
Similar Items
-
Inferring Sparse Preference Lists from Partial Information
by: Farias, Vivek, et al.
Published: (2021) -
Nonparametric choice modeling : applications to operations management
by: Jagabathula, Srikanth
Published: (2012) -
Scheduling algorithms for arbitrary communication networks
by: Jagabathula, Srikanth
Published: (2009) -
Sync-Rank: Robust ranking, constrained ranking and rank aggregation via eigenvector and SDP synchronization
by: Cucuringu, M
Published: (2016) -
Fair Scheduling in Networks Through Packet Election
by: Jagabathula, Srikanth, et al.
Published: (2012)