中文
相关论文

相关论文: Locating ballot drop boxes

200 篇论文

We provide mechanisms and new metric distortion bounds for line-up elections. In such elections, a set of $n$ voters, $m$ candidates, and $\ell$ positions are all located in a metric space. The goal is to choose a set of candidates and…

计算机科学与博弈论 · 计算机科学 2025-02-25 Christopher Jerrett , Yue Han , Elliot Anshelevich

We study strategic candidate positioning in multidimensional spatial-voting elections. Voters and candidates are represented as points in $\mathbb{R}^d$, and each voter supports the candidate that is closest under a distance induced by an…

计算机科学与博弈论 · 计算机科学 2025-08-20 Colin Cleveland , Bart de Keijzer , Maria Polukarov

Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control…

计算机科学与博弈论 · 计算机科学 2015-09-03 Sergey Polyakovskiy , Rudolf Berghammer , Frank Neumann

Although public clouds still occupy the largest portion of the total cloud infrastructure, private clouds are attracting increasing interest from both industry and academia because of their better security and privacy control. According to…

分布式、并行与集群计算 · 计算机科学 2020-09-16 Yan Zhao , Hongwei Liu , Yan Wang , Zhan Zhang , Decheng Zuo

Case Based Reasoning and particularly Estimation by Analogy, has been used in a number of problem-solving areas, such as cost estimation. Conventional methods, despite the lack of a sound criterion for choosing nearest projects, were based…

软件工程 · 计算机科学 2010-12-30 Makrina Viola Kosti , Nikolaos Mittas , Lefteris Angelis

A common problem in private data analysis is the partition selection problem, where each user holds a set of partitions (e.g. keys in a GROUP BY operation) from a possibly unbounded set. The challenge here is in maximizing the set of…

密码学与安全 · 计算机科学 2026-03-12 Charlie Harrison , Pasin Manurangsi

The growth of e-commerce has created increasing complexity in logistics services. To remain competitive, logistics and e-commerce companies are exploring new modes as supplements to traditional home delivery, one of which is the…

最优化与控制 · 数学 2021-08-27 Yun Hui Lin , Yuan Wang , Loo Hay Lee , Ek Peng Chew

In wireless networks, many problems can be formulated as subset selection problems where the goal is to select a subset from the ground set with the objective of maximizing some objective function. These problems are typically NP-hard and…

信息论 · 计算机科学 2019-05-03 Chiranjib Saha , Harpreet S. Dhillon

While conventional shared demand-responsive transportation (SDRT) systems mostly operate on a door-to-door policy, the usage of meeting points for the pick-up and drop-off of user groups can offer several advantages, like fewer stops and…

Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coordinate their values such that the sum of the resulting…

人工智能 · 计算机科学 2014-01-16 William Yeoh , Ariel Felner , Sven Koenig

Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of…

数据结构与算法 · 计算机科学 2018-12-10 Xinhang Zhang , Haoyuan Hu , Longfei Wang , Zhijun Sun , Ying Zhang , Kunpeng Han , Yinghui Xu

Considering a network with $n$ nodes, where each node initially votes for one (or more) choices out of $K$ possible choices, we present a Distributed Multi-choice Voting/Ranking (DMVR) algorithm to determine either the choice with maximum…

分布式、并行与集群计算 · 计算机科学 2017-03-28 Saber Salehkaleybar , Arsalan Sharif-Nassab , S. Jamaloddin Golestani

We consider a spatial voting model where both candidates and voters are positioned in the $d$-dimensional Euclidean space, and each voter ranks candidates based on their proximity to the voter's ideal point. We focus on the scenario where…

计算机科学与博弈论 · 计算机科学 2025-05-20 Hadas Shachnai , Rotem Shavitt , Andreas Wiese

We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (each ranking the candidates from the best to the worst), a despised candidate $d$, a budget $B$,…

人工智能 · 计算机科学 2020-05-07 Andrzej Kaczmarczyk , Piotr Faliszewski

Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AAMAS 2017] initiated the algorithmic study of a…

数据结构与算法 · 计算机科学 2020-02-19 Eduard Eiben , Fedor V. Fomin , Fahad Panolan , Kirill Simonov

Selecting cost-effective optimal sensor configurations for subsequent inference of parameters in black-box stochastic systems faces significant computational barriers. We propose a novel and robust approach, modelling the joint distribution…

机器学习 · 统计学 2025-03-04 Paula Cordero-Encinar , Tobias Schröder , Peter Yatsyshin , Andrew Duncan

In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards $U$ (each with a location and a cost), a database of trajectories $\mathcal{T}$ and a budget $L$, find a set of…

社会与信息网络 · 计算机科学 2018-09-18 Ping Zhang , Zhifeng Bao , Yuchen Li , Guoliang Li , Yipeng Zhang , Zhiyong Peng

Data is the key asset for organizations and data sharing is lifeline for organization growth; which may lead to data loss. Data leakage is the most critical issue being faced by organizations. In order to mitigate the data leakage issues…

机器学习 · 计算机科学 2023-12-22 Kishu Gupta , Ashwani Kush

For more than a century, election officials across the United States have inspected voting machines before elections using a procedure called Logic and Accuracy Testing (LAT). This procedure consists of election officials casting a test…

密码学与安全 · 计算机科学 2024-10-01 Braden L. Crimmins , J. Alex Halderman , Bradley Sturt

We consider search problems with nonobligatory inspection and single-item or combinatorial selection. A decision maker is presented with a number of items, each of which contains an unknown price, and can pay an inspection cost to observe…

计算机科学与博弈论 · 计算机科学 2025-01-17 Ziv Scully , Laura Doval