{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-random-attention-model","title":"A Random Attention Model","arxiv_id":"1712.03448","date":"2019-08-29","proceeding":null,"authors":[],"abstract":"This paper illustrates how one can deduce preference from observed choices\nwhen attention is not only limited but also random. In contrast to earlier\napproaches, we introduce a Random Attention Model (RAM) where we abstain from\nany particular attention formation, and instead consider a large class of\nnonparametric random attention rules. Our model imposes one intuitive\ncondition, termed Monotonic Attention, which captures the idea that each\nconsideration set competes for the decision-maker's attention. We then develop\nrevealed preference theory within RAM and obtain precise testable implications\nfor observable choice probabilities. Based on these theoretical findings, we\npropose econometric methods for identification, estimation, and inference of\nthe decision maker's preferences. To illustrate the applicability of our\nresults and their concrete empirical content in specific settings, we also\ndevelop revealed preference theory and accompanying econometric methods under\nadditional nonparametric assumptions on the consideration set for binary choice\nproblems. Finally, we provide general purpose software implementation of our\nestimation and inference results, and showcase their performance using\nsimulations.","url_abs":"http://arxiv.org/abs/1712.03448v3","url_pdf":"http://arxiv.org/pdf/1712.03448v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-random-attention-model","repo_url":"https://github.com/mdcattaneo/replication-CMMS_2020_JPE","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"mdcattaneo/replication-CMMS_2020_JPE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"229d82d6b178c753ebd263a2d72290d29ac5af66531f62860668f028c627f32e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}