English
Related papers

Related papers: Multiuser Commitment over Noisy Channels

200 papers

Certifying verification algorithms not only return whether a given property holds or not, but also provide an accompanying independently checkable certificate and a corresponding witness. The certificate can be used to easily validate the…

Logic in Computer Science · Computer Science 2025-01-13 Christel Baier , Calvin Chau , Sascha Klüppelholz

We consider the problem of Probably Approximate Correct (PAC) learning of a binary classifier from noisy labeled examples acquired from multiple annotators (each characterized by a respective classification noise rate). First, we consider…

Machine Learning · Computer Science 2012-10-19 Dinesh Garg , Sourangshu Bhattacharya , S. Sundararajan , Shirish Shevade

This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent objects from various primitives including window registers and…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-03 Hagit Attiya , Armando Castañeda , Constantin Enea

The field of information retrieval often works with limited and noisy data in an attempt to classify documents into subjective categories, e.g., relevance, sentiment and controversy. We typically quantify a notion of agreement to understand…

Information Retrieval · Computer Science 2018-06-14 John Foley

Semantically connecting users and items is a fundamental problem for the matching stage of an industrial recommender system. Recent advances in this topic are based on multi-channel retrieval to efficiently measure users' interest on items…

Information Retrieval · Computer Science 2022-02-15 Yujie Lu , Ping Nie , Shengyu Zhang , Ming Zhao , Ruobing Xie , William Yang Wang , Yi Ren

This work introduces a novel blackbox optimization algorithm for computationally expensive constrained multi-fidelity problems. When applying a direct search method to such problems, the scarcity of feasible points may lead to numerous…

Optimization and Control · Mathematics 2025-04-09 Stéphane Alarie , Charles Audet , Miguel Diago , Sébastien Le Digabel , Xavier Lebeuf

We study the fundamental network capacity of a multi-user wireless downlink under two assumptions: (1) Channels are not explicitly measured and thus instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov chains. This is…

Information Theory · Computer Science 2010-04-23 Chih-ping Li , Michael J. Neely

Communication networks shared by many users are a widespread challenge nowadays. In this paper we address several aspects of this challenge simultaneously: learning unknown stochastic network characteristics, sharing resources with other…

Machine Learning · Computer Science 2018-08-16 Orly Avner , Shie Mannor

In this paper, we study behavior of bidders in an experimental launch of a new advertising auction platform by Zillow, as Zillow switched from negotiated contracts to using auctions in several geographically isolated markets. A unique…

Computer Science and Game Theory · Computer Science 2017-04-03 Pooya Jalaly , Denis Nekipelov , Eva Tardos

In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Jean-Marie Gorce

In this paper, we study online double auctions, where multiple sellers and multiple buyers arrive and depart dynamically to exchange one commodity. We show that there is no deterministic online double auction that is truthful and…

Computer Science and Game Theory · Computer Science 2013-11-04 Dengji Zhao , Dongmo Zhang , Laurent Perrussel

A powerful feature in mechanism design is the ability to irrevocably commit to the rules of a mechanism. Commitment is achieved by public declaration, which enables players to verify incentive properties in advance and the outcome in…

Theoretical Economics · Economics 2025-07-08 Ran Canetti , Amos Fiat , Yannai A. Gonczarowski

Suppose that we wish to estimate a user's preference vector $w$ from paired comparisons of the form "does user $w$ prefer item $p$ or item $q$?," where both the user and items are embedded in a low-dimensional Euclidean space with distances…

Machine Learning · Statistics 2019-05-27 Gregory H. Canal , Andrew K. Massimino , Mark A. Davenport , Christopher J. Rozell

We consider repeated multi-unit auctions with uniform pricing, which are widely used in practice for allocating goods such as carbon licenses. In each round, $K$ identical units of a good are sold to a group of buyers that have valuations…

Computer Science and Game Theory · Computer Science 2024-01-17 Simina Brânzei , Mahsa Derakhshan , Negin Golrezaei , Yanjun Han

We study the complexity of constructive bribery in the context of structured multiwinner approval elections. Given such an election, we ask whether a certain candidate can join the winning committee by adding, deleting, or swapping…

Computer Science and Game Theory · Computer Science 2024-01-23 Bartosz Kusek , Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Dušan Knop

We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…

Information Theory · Computer Science 2007-07-13 Peng Cheng , Guanding Yu , Zhaoyang Zhang , Hsiao-Hwa Chen , Peiliang Qiu

Collaborative filtering is the process of making recommendations regarding the potential preference of a user, for example shopping on the Internet, based on the preference ratings of the user and a number of other users for various items.…

Information Retrieval · Computer Science 2013-01-14 Rita Sharma , David L Poole

We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal propagation and…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-08 Mohsen Ghaffari , Erez Kantor , Nancy Lynch , Calvin Newport

We consider the $N$-user broadcast erasure channel with $N$ unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the…

Information Theory · Computer Science 2016-11-17 Marios Gatzianas , Leonidas Georgiadis , Leandros Tassiulas

Budget-management systems are one of the key components of modern auction markets. Internet advertising platforms typically offer advertisers the possibility to pace the rate at which their budget is depleted, through budget-pacing…

Computer Science and Game Theory · Computer Science 2021-06-18 Andrea Celli , Riccardo Colini-Baldeschi , Christian Kroer , Eric Sodomka
‹ Prev 1 8 9 10 Next ›