{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/optimal-er-auctions-through-attention","title":"Optimal-er Auctions through Attention","arxiv_id":"2202.13110","date":"2022-02-26","proceeding":null,"authors":["Dmitry Ivanov","Iskander Safiulin","Igor Filippov","Ksenia Balabaeva"],"abstract":"RegretNet is a recent breakthrough in the automated design of revenue-maximizing auctions. It combines the flexibility of deep learning with the regret-based approach to relax the Incentive Compatibility (IC) constraint (that participants prefer to bid truthfully) in order to approximate optimal auctions. We propose two independent improvements of RegretNet. The first is a neural architecture denoted as RegretFormer that is based on attention layers. The second is a loss function that requires explicit specification of an acceptable IC violation denoted as regret budget. We investigate both modifications in an extensive experimental study that includes settings with constant and inconstant number of items and participants, as well as novel validation procedures tailored to regret-based approaches. We find that RegretFormer consistently outperforms RegretNet in revenue (i.e. is optimal-er) and that our loss function both simplifies hyperparameter tuning and allows to unambiguously control the revenue-regret trade-off by selecting the regret budget.","url_abs":"https://arxiv.org/abs/2202.13110v4","url_pdf":"https://arxiv.org/pdf/2202.13110v4.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":"optimal-er-auctions-through-attention","repo_url":"https://github.com/dimonenka/optimaler","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2202.13110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13110"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dimonenka/optimaler","reach":null}],"summary":{"ran":7,"unverified":1},"by_repo_kind":{"official":{"samples":8,"ran":7,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"16d5893cc18a4c29","entry":"AdditiveNet","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"16d5893cc18a4c29"}},{"code_sha256_prefix":"6c3b3e5a39c1e437","entry":"AttentionHead","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6c3b3e5a39c1e437"}},{"code_sha256_prefix":"61c156bc27fe3367","entry":"Exchangeable","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"61c156bc27fe3367"}},{"code_sha256_prefix":"970bd62b992448ea","entry":"MHAttentionBody","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"970bd62b992448ea"}},{"code_sha256_prefix":"2a4cfe231bde233c","entry":"MultiHeadAttention","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2a4cfe231bde233c"}},{"code_sha256_prefix":"3298160008ddb060","entry":"PositionalEncoding","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3298160008ddb060"}},{"code_sha256_prefix":"2f715bdea4c18c5f","entry":"ScaledDotProductAttention","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2f715bdea4c18c5f"}},{"code_sha256_prefix":"ace83588d2159d55","entry":"AdditiveNetAttention","repo":"dimonenka/optimaler","repo_kind":"official","path":"core/nets/additive_net_attention.py","file_url":"https://github.com/dimonenka/optimaler/blob/HEAD/core/nets/additive_net_attention.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ace83588d2159d55"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}