A Generalized Cover's Problem
Explore this paper's citation graph
Summary
It is established that a random permutation of n adversarially constructed real numbers can be reconstructed with better-than-random probability, provided that certain among the numbers it permutes are made visible during the process.
- Type
- preprint
- Published
- 2018-04-17
- Cited by
- 0
- References
- 18
- Access
- Open access
- OpenAlex
- https://openalex.org/W2797610470
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:73612880
Keywords
Permutation (music), Cover (algebra), Random permutation, Mathematics, Code (set theory)
References
- Two-envelope paradox
- Open Problems in Communication and Computation
- Utility Maximization, Choice and Preference
- One Observation behind Two-Envelope Puzzles
- The Existence of a Utility Function to Represent Preferences
- A Solution to the Game of Googol
- Minimax Stopping Rules When the Underlying Distribution is Uniform
- Permutation Generation Methods
- On the existence of utility functions ii
- Semicontinuous extension of a partial order
- Who Solved the Secretary Problem
- ON THE CONTINUITY PROPERTIES OF PARETIAN UTILITY
- A On The Game Of Googol As The Secretary Problem
- Guess the Larger Number
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Mathematical Economics: Continuity properties of Paretian utility
- Algebraic Graph Theory
Cited by
No citing papers recorded for this paper.
Related papers
- A stochastic model for the number of fixed points of a Welch Costas permutation
- Generating a random cyclic permutation
- Counting fixed-length permutation patterns
- Lower bound on the running time of Pop-Stack Sorting on a random permutation
- An AUC-based permutation variable importance measure for random forests
- The Number of Increasing Subsequences of the Random Permutation
- An Implementation of Conflict-Free Offline Permutation on the GPU