Results 11 to 20 of about 701,199 (295)
Public Bayesian persuasion: being almost optimal and almost persuasive [PDF]
Algorithmica, 2023 We study algorithmic Bayesian persuasion problems in which the principal (a.k.a. the sender) has to persuade multiple agents (a.k.a. receivers) by using public communication channels. Specifically, our model follows the multi-receiver model with no inter-
Gatti, Nicola +5 more
core +5 more sources
Combinatorica, 1998 A (K, E) disperser graph G = (VI, V2, E) is a bipartite graph wit.h the property that for any subset A E VI of cardinality K, the neighbors of A cover at least 1- E fraction of t,he vertices of V2.
Amnon Ta-Shma
core +2 more sources
Optimal cost almost-sure reachability in POMDPs [PDF]
Artificial Intelligence, 2015 We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the ...
CHMELIK, M +8 more
core +5 more sources
Simple Economies are Almost Optimal [PDF]
Proceedings of the 22nd ACM Conference on Economics and Computation, 2021 Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit $n$ bidders to the auction. Alternatively, the seller can have a much cheaper and focused marketing operation and recruit the same number of bidders from a single market segment.
Ban, Amir +3 more
openaire +2 more sources
Stochastic Optimization is (Almost) as easy as Deterministic Optimization [PDF]
45th Annual IEEE Symposium on Foundations of Computer Science, 2004 Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the well-studied paradigm of 2-stage models with recourse: first, given only distributional information about (some of) the data one commits on initial actions, and then once the
David B. Shmoys, Chaitanya Swamy
openaire +1 more source
An Almost Optimal Edit Distance Oracle
CoRR, 2021 We consider the problem of preprocessing two strings $S$ and $T$, of lengths $m$ and $n$, respectively, in order to be able to efficiently answer the following queries: Given positions $i,j$ in $S$ and positions $a,b$ in $T$, return the optimal alignment of $S[i \mathinner{.\,.} j]$ and $T[a \mathinner{.\,.} b]$. Let $N=mn$.
Panagiotis Charalampopoulos +3 more
openaire +4 more sources
Constructions of optimal and almost optimal locally repairable codes [PDF]
2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE), 2014 5 pages ...
Toni Ernvall +2 more
openaire +2 more sources
Applied Sciences, 2021 For the assumed bale volume, its dimensions (diameter, height), minimizing the consumption of the plastic film used for bale wrapping with the combined 3D method, depend on film and wrapping parameters.
Anna Stankiewicz
doaj +1 more source
Greedy Is an Almost Optimal Deque [PDF]
, 2015 In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Patrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP.
Parinya Chalermsook +4 more
openaire +4 more sources
Almost optimal manipulation of a pair of alternatives
CoRR, 2023 The role of an expert in the decision-making process is crucial, as the final recommendation depends on his disposition, clarity of mind, experience, and knowledge of the problem. However, the recommendation also depends on their honesty. But what if the expert is dishonest?
Jacek Szybowski +2 more
openaire +2 more sources