Competitive Information Design
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Competitive Information Design in Sequential Search
Announce Type: new Abstract: Advertisements often strategically disclose information to consumers who make decisions on further information acquisition and eventual purchase. Anderson and Renault (2006) model this problem using an information design framework, where the advertiser acts as a sender and the consumer as a receiver. We extend this model to a competitive setting with horizontally differentiated senders competing for a unit-demand receiver.
Privacy-preserving Information Sharing in Oligopoly Competitions
arXiv:2606.02348v1 Announce Type: cross Abstract: Information sharing among competing suppliers can improve decision-making under uncertainty, yet strategic concerns regarding rival exploitation often deter voluntary disclosure. We study information-sharing mechanisms in a Cournot oligopoly with uncertain demand, where a platform aggregates suppliers' signals through privacy-preserving channels and may also possess an exogenous external signal. The central challenge is to balance strategic...
Minutes of the Synchronisation thematic engagement working group - 30 April 2026
Minutes Item 1: Introduction The Bank introduced the first co-creation thematic engagement working group on synchronisation since the terms of reference were refreshed, outlining the group's purpose, structure, and the context of ongoing synchronisation initiatives. The Bank explained that the co-creation working group is intended to gather focused input from industry participants to inform the design of a live synchronisation service, building on previous and ongoing experimentation and...
RISE: A Rust Library for Inverted Index Search Engines
arXiv:2606.07187v1 Announce Type: new Abstract: Inverted indexes are a crucial data structure for efficient information retrieval in large text corpora. They enable fast full-text search by mapping each term to the documents in which it appears, on top of which efficient algorithms quickly retrieve the documents relevant to a user query. We present RISE, a novel inverted index library implemented in Rust, designed to deliver high performance and efficiency for information retrieval tasks.
LiteViLNet: Lightweight Vision-LiDAR Fusion Network for Efficient Road Segmentation
arXiv:2605.21007v2 Announce Type: replace Abstract: Road segmentation is a fundamental perception task for autonomous driving and intelligent robotic systems, requiring both high accuracy and real-time inference, especially for deployment on resource-constrained edge devices. Existing multi-modal road segmentation methods often rely on heavy transformer-based encoders to achieve state-of-the-art performance, but their enormous computational cost prohibits real-time deployment on embedded...
Imagine Before You Draw: Visual Prompt Engineering for Image Generation
arXiv:2606.04457v1 Announce Type: new Abstract: Incorporating visual semantic representations as an intermediate step before image generation can reduce the modeling difficulty between text and images, thereby improving generation quality. Recent works such as X-Omni and BLIP3o-Next have explored this direction, but they typically use a two-stage external pipeline: a separate autoregressive model first generates semantic tokens, which are then fed as conditioning to an independent diffusion...
In a first, scientists translated an entire viral genome so a quantum computer could read and analyze it
In a first, scientists translated an entire viral genome so a quantum computer could read and analyze it Scientists have uploaded a viral genome to a quantum computer, marking an important step for the future of quantum-enabled advancements in biology. Scientists say they have uploaded a real genome to a quantum computer for the first time, marking an important step in applying the emerging technology to biology. The researchers encoded the entire genome of the hepatitis D virus (HDV) onto a...
Structure-Aware Modeling of Multiple-Choice Questions Improves Automatic Difficulty Estimation
arXiv:2606.08988v1 Announce Type: new Abstract: Automatic Question Difficulty Estimation (AQDE) holds growing promise for educational assessment because it has the potential to yield difficulty estimates that are competitive with expert judgment, while helping reduce the time and financial burden associated with pilot administrations and scaling to digital testing contexts. Prior AQDE studies report mixed evidence on whether adding distractors as additional text to the question stem and the...
Beyond Semantic Understanding: Preserving Collaborative Frequency Components in LLM-based Recommendation
arXiv:2508.10312v2 Announce Type: replace Abstract: Recommender systems in concert with Large Language Models (LLMs) present promising avenues for generating semantically-informed recommendations. However, LLM-based recommenders exhibit a tendency to overemphasize semantic correlations within users' interaction history. When taking pretrained collaborative ID embeddings as input, LLM-based recommenders progressively weaken the inherent collaborative signals as the embeddings propagate...
MIPIC: Matryoshka Representation Learning via Self-Distilled Intra-Relational and Progressive Information Chaining
arXiv:2604.24374v2 Announce Type: replace Abstract: Representation learning is fundamental to NLP, but building embeddings that work well at different computational budgets is challenging. Matryoshka Representation Learning (MRL) offers a flexible inference paradigm through nested embeddings; however, learning such structures requires explicit coordination of how information is arranged across embedding dimensionality and model depth. In this work, we propose MIPIC (Matryoshka Representation...