English
Related papers

Related papers: Maximizing Clearance Rate by Penalizing Redundant …

200 papers

This paper explores the possibility of near-optimally solving multi-agent, multi-task NP-hard planning problems with time-dependent rewards using a learning-based algorithm. In particular, we consider a class of robot/machine scheduling…

Machine Learning · Computer Science 2023-08-15 Hyunwook Kang , Taehwan Kwon , Jinkyoo Park , James R. Morrison

We investigate task clustering for deep-learning based multi-task and few-shot learning in a many-task setting. We propose a new method to measure task similarities with cross-task transfer performance matrix for the deep learning scenario.…

Machine Learning · Computer Science 2018-05-21 Mo Yu , Xiaoxiao Guo , Jinfeng Yi , Shiyu Chang , Saloni Potdar , Gerald Tesauro , Haoyu Wang , Bowen Zhou

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

Theoretical Economics · Economics 2025-10-20 Shixin Wang

Sparse Mobile CrowdSensing (MCS) is a novel MCS paradigm where data inference is incorporated into the MCS process for reducing sensing costs while its quality is guaranteed. Since the sensed data from different cells (sub-areas) of the…

Artificial Intelligence · Computer Science 2018-05-25 Leye Wang , Wenbin Liu , Daqing Zhang , Yasha Wang , En Wang , Yongjian Yang

As the number of resources on chip multiprocessors (CMPs) increases, the complexity of how to best allocate these resources increases drastically. Because the higher number of applications makes the interaction and impacts of various memory…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-20 Farshid Farhat , Diman Zad Tootaghaj

Crowdsourced software development (CSD) offers a series of specified tasks to a large crowd of trustworthy software workers. Topcoder is a leading platform to manage the whole process of CSD. While increasingly accepted as a realistic…

Software Engineering · Computer Science 2016-10-14 Muhammad Rezaul Karim , David Messinger , Ye Yang , Guenther Ruhe

We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding…

Computer Science and Game Theory · Computer Science 2024-11-15 Gagan Aggarwal , Anupam Gupta , Andres Perlroth , Grigoris Velegkas

We study crowdsourcing quality management, that is, given worker responses to a set of tasks, our goal is to jointly estimate the true answers for the tasks, as well as the quality of the workers. Prior work on this problem relies primarily…

Other Computer Science · Computer Science 2015-03-03 Akash Das Sarma , Aditya Parameswaran , Jennifer Widom

We explore the design of an effective crowdsourcing system for an $M$-ary classification task. Crowd workers complete simple binary microtasks whose results are aggregated to give the final decision. We consider the scenario where the…

Human-Computer Interaction · Computer Science 2017-10-30 Qunwei Li , Pramod K. Varshney

For decades, Simultaneous Ascending Auction (SAA) has been the most widely used mechanism for spectrum auctions, and it has recently gained popularity for allocating 5G licenses in many countries. Despite its relatively simple rules, SAA…

Computer Science and Game Theory · Computer Science 2024-07-17 Alexandre Pacaud , Aurélien Bechler , Marceau Coupechoux

We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to enter. Unlike all-pay auctions where a usual design objective…

Computer Science and Game Theory · Computer Science 2011-11-15 Shuchi Chawla , Jason D. Hartline , Balasubramanian Sivan

We consider an extension of the rollout algorithm that applies to constrained deterministic dynamic programming, including challenging combinatorial optimization problems. The algorithm relies on a suboptimal policy, called base heuristic.…

Optimization and Control · Mathematics 2020-04-28 Dimitri Bertsekas

Ineffective fundraising lowers the resources charities can use to provide goods. We combine a field experiment and a causal machine-learning approach to increase a charity's fundraising effectiveness. The approach optimally targets a…

Econometrics · Economics 2021-09-30 Tobias Cagala , Ulrich Glogowsky , Johannes Rincke , Anthony Strittmatter

We study a setup in which a system operator hires a sensor to exert costly effort to collect accurate measurements of a value of interest over time. At each time, the sensor is asked to report his observation to the operator, and is…

Optimization and Control · Mathematics 2017-02-22 Donya G. Dobakhshari , Parinaz Naghizadeh , Mingyan Liu , Vijay Gupta

The proliferation of the Internet has led to the emergence of online advertising, driven by the mechanics of online auctions. In these repeated auctions, software agents participate on behalf of aggregated advertisers to optimize for their…

Machine Learning · Computer Science 2023-06-13 Haozhe Wang , Chao Du , Panyan Fang , Li He , Liang Wang , Bo Zheng

In recommendation systems, items are likely to be exposed to various users and we would like to learn about the familiarity of a new user with an existing item. This can be formulated as an anomaly detection (AD) problem distinguishing…

Machine Learning · Computer Science 2022-09-22 Ke Bai , Aonan Zhang , Zhizhong Li , Ricardo Heano , Chong Wang , Lawrence Carin

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

Crowdsourcing has emerged as a paradigm for leveraging human intelligence and activity to solve a wide range of tasks. However, strategic workers will find enticement in their self-interest to free-ride and attack in a crowdsourcing contest…

Computer Science and Game Theory · Computer Science 2018-01-01 Jianfeng Lu , Yun Xin , Zhao Zhang , Shaojie Tang , Songyuan Yan , Changbing Tang

This paper investigates the incentive mechanism design from a novel and practically important perspective in which mobile users as contributors do not join simultaneously and a requester desires large efforts from early contributors. A…

Computer Science and Game Theory · Computer Science 2017-10-06 Yuedong Xu , Yifan Zhou , Yifan Mao , Xu Chen , Xiang Li

Cluster-based randomized experiments are popular designs for mitigating the bias of standard estimators when interference is present and classical causal inference and experimental design assumptions (such as SUTVA or ITR) do not hold.…

Methodology · Statistics 2018-03-09 Jean Pouget-Abadie , David C. Parkes , Vahab Mirrokni , Edoardo M. Airoldi