Amanote Research
Register
Sign In
Identifying Preferences in Networks With Bounded Degree
doi 10.1920/wp.cem.2016.5416
Full Text
Open PDF
Abstract
Available in
full text
Date
December 16, 2016
Authors
Elie Tamer
Áureo de Paula
Seth Richards-Shubik
Publisher
The IFS
Related search
Identifying Preferences in Networks With Bounded Degree
Econometrica
Economics
Econometrics
Delay Performance of CSMA in Networks With Bounded Degree Conflict Graphs
Fractional Path Coloring in Bounded Degree Trees With Applications
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Testing Expansion in Bounded-Degree Graphs
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks
Mobile Networks and Applications
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Intransitive Permutation Groups With Bounded Movement Having Maximum Degree
JOURNAL OF ADVANCES IN MATHEMATICS
Ramsey Goodness of Bounded Degree Trees
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree
Ars Mathematica Contemporanea
Algebra
Combinatorics
Number Theory
Geometry
Discrete Mathematics
Theoretical Computer Science
Topology
Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves
Operations Research Letters
Industrial
Applied Mathematics
Manufacturing Engineering
Management Science
Operations Research
Software