Information Technology Convergence and Services最新文献

Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round 不观察回报就能获胜：利用行为偏差，几乎每局必胜

Information Technology Convergence and Services Pub Date : 2024-03-29 DOI: 10.4230/LIPIcs.ITCS.2024.18

Avrim Blum, Melissa Dutz

{"title":"Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round","authors":"Avrim Blum, Melissa Dutz","doi":"10.4230/LIPIcs.ITCS.2024.18","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2024.18","url":null,"abstract":"Gameplay under various forms of uncertainty has been widely studied. Feldman et al. (2010) studied a particularly low-information setting in which one observes the opponent's actions but no payoffs, not even one's own, and introduced an algorithm which guarantees one's payoff nonetheless approaches the minimax optimal value (i.e., zero) in a symmetric zero-sum game. Against an opponent playing a minimax-optimal strategy, approaching the value of the game is the best one can hope to guarantee. However, a wealth of research in behavioral economics shows that people often do not make perfectly rational, optimal decisions. Here we consider whether it is possible to actually win in this setting if the opponent is behaviorally biased. We model several deterministic, biased opponents and show that even without knowing the game matrix in advance or observing any payoffs, it is possible to take advantage of each bias in order to win nearly every round (so long as the game has the property that each action beats and is beaten by at least one other action). We also provide a partial characterization of the kinds of biased strategies that can be exploited to win nearly every round, and provide algorithms for beating some kinds of biased strategies even when we don't know which strategy the opponent uses.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"45 3","pages":"18:1-18:18"},"PeriodicalIF":0.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140367501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dynamic Maximal Matching in Clique Networks 克利克网络中的动态最大匹配

Information Technology Convergence and Services Pub Date : 2024-01-28 DOI: 10.4230/LIPIcs.ITCS.2024.73

Minming Li, Peter Robinson, Xianbin Zhu

{"title":"Dynamic Maximal Matching in Clique Networks","authors":"Minming Li, Peter Robinson, Xianbin Zhu","doi":"10.4230/LIPIcs.ITCS.2024.73","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2024.73","url":null,"abstract":"We consider the problem of computing a maximal matching with a distributed algorithm in the presence of batch-dynamic changes to the graph topology. We assume that a graph of $n$ nodes is vertex-partitioned among $k$ players that communicate via message passing. Our goal is to provide an efficient algorithm that quickly updates the matching even if an adversary determines batches of $ell$ edge insertions or deletions. Assuming a link bandwidth of $O(betalog n)$ bits per round, for a parameter $beta ge 1$, we first show a lower bound of $Omega( frac{ell,log k}{beta,k^2log n})$ rounds for recomputing a matching assuming an oblivious adversary who is unaware of the initial (random) vertex partition as well as the current state of the players, and a stronger lower bound of $Omega(frac{ell}{beta,klog n})$ rounds against an adaptive adversary, who may choose any balanced (but not necessarily random) vertex partition initially and who knows the current state of the players. We also present a randomized algorithm that has an initialization time of $O( lceilfrac{n}{beta,k}rceillog n )$ rounds, while achieving an update time that that is independent of $n$: In more detail, the update time is $O( lceil frac{ell}{beta,k} rceil log(beta,k))$ against an oblivious adversary, who must fix all updates in advance. If we consider the stronger adaptive adversary, the update time becomes $O( lceil frac{ell}{sqrt{beta,k}}rceil log(beta,k))$ rounds.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"1 1","pages":"73:1-73:21"},"PeriodicalIF":0.0,"publicationDate":"2024-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139592085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quickly Determining Who Won an Election 快速确定谁赢得了选举

Information Technology Convergence and Services Pub Date : 2024-01-19 DOI: 10.4230/LIPIcs.ITCS.2024.61

Lisa Hellerstein, Naifeng Liu, Kevin Schewior

引用次数: 0

The Space-Time Cost of Purifying Quantum Computations 净化量子计算的时空成本

Information Technology Convergence and Services Pub Date : 2024-01-15 DOI: 10.4230/LIPIcs.ITCS.2024.102

Mark Zhandry

引用次数: 0

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness 张量、群和多项式的同构问题的复杂性I:张量同构-完备性

Information Technology Convergence and Services Pub Date : 2023-04-26 DOI: 10.4230/LIPIcs.ITCS.2021.31

Joshua A. Grochow, Youming Qiao

引用次数: 27

Differentially Private Continual Releases of Streaming Frequency Moment Estimations 流频率矩估计的差分私有连续释放

Information Technology Convergence and Services Pub Date : 2023-01-13 DOI: 10.48550/arXiv.2301.05605

Alessandro Epasto, Jieming Mao, Andrés Muñoz Medina, V. Mirrokni, Sergei Vassilvitskii, Peilin Zhong

{"title":"Differentially Private Continual Releases of Streaming Frequency Moment Estimations","authors":"Alessandro Epasto, Jieming Mao, Andrés Muñoz Medina, V. Mirrokni, Sergei Vassilvitskii, Peilin Zhong","doi":"10.48550/arXiv.2301.05605","DOIUrl":"https://doi.org/10.48550/arXiv.2301.05605","url":null,"abstract":"The streaming model of computation is a popular approach for working with large-scale data. In this setting, there is a stream of items and the goal is to compute the desired quantities (usually data statistics) while making a single pass through the stream and using as little space as possible. Motivated by the importance of data privacy, we develop differentially private streaming algorithms under the continual release setting, where the union of outputs of the algorithm at every timestamp must be differentially private. Specifically, we study the fundamental $ell_p$ $(pin [0,+infty))$ frequency moment estimation problem under this setting, and give an $varepsilon$-DP algorithm that achieves $(1+eta)$-relative approximation $(forall etain(0,1))$ with $mathrm{poly}log(Tn)$ additive error and uses $mathrm{poly}log(Tn)cdot max(1, n^{1-2/p})$ space, where $T$ is the length of the stream and $n$ is the size of the universe of elements. Our space is near optimal up to poly-logarithmic factors even in the non-private setting. To obtain our results, we first reduce several primitives under the differentially private continual release model, such as counting distinct elements, heavy hitters and counting low frequency elements, to the simpler, counting/summing problems in the same setting. Based on these primitives, we develop a differentially private continual release level set estimation approach to address the $ell_p$ frequency moment estimation problem. We also provide a simple extension of our results to the harder sliding window model, where the statistics must be maintained over the past $W$ data items.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123395411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Graph Searching with Predictions 带预测的图搜索

Information Technology Convergence and Services Pub Date : 2022-12-29 DOI: 10.48550/arXiv.2212.14220

Sid Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhou Li

{"title":"Graph Searching with Predictions","authors":"Sid Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhou Li","doi":"10.48550/arXiv.2212.14220","DOIUrl":"https://doi.org/10.48550/arXiv.2212.14220","url":null,"abstract":"Consider an agent exploring an unknown graph in search of some goal state. As it walks around the graph, it learns the nodes and their neighbors. The agent only knows where the goal state is when it reaches it. How do we reach this goal while moving only a small distance? This problem seems hopeless, even on trees of bounded degree, unless we give the agent some help. This setting with ''help'' often arises in exploring large search spaces (e.g., huge game trees) where we assume access to some score/quality function for each node, which we use to guide us towards the goal. In our case, we assume the help comes in the form of distance predictions: each node $v$ provides a prediction $f(v)$ of its distance to the goal vertex. Naturally if these predictions are correct, we can reach the goal along a shortest path. What if the predictions are unreliable and some of them are erroneous? Can we get an algorithm whose performance relates to the error of the predictions? In this work, we consider the problem on trees and give deterministic algorithms whose total movement cost is only $O(OPT + Delta cdot ERR)$, where $OPT$ is the distance from the start to the goal vertex, $Delta$ the maximum degree, and the $ERR$ is the total number of vertices whose predictions are erroneous. We show this guarantee is optimal. We then consider a ''planning'' version of the problem where the graph and predictions are known at the beginning, so the agent can use this global information to devise a search strategy of low cost. For this planning version, we go beyond trees and give an algorithms which gets good performance on (weighted) graphs with bounded doubling dimension.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125661823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Rigidity in Mechanism Design and its Applications 机构设计中的刚度及其应用

Information Technology Convergence and Services Pub Date : 2022-12-19 DOI: 10.48550/arXiv.2212.09847

Shahar Dobzinski, Ariel Shaulker

{"title":"Rigidity in Mechanism Design and its Applications","authors":"Shahar Dobzinski, Ariel Shaulker","doi":"10.48550/arXiv.2212.09847","DOIUrl":"https://doi.org/10.48550/arXiv.2212.09847","url":null,"abstract":"We introduce the notion of rigidity in auction design and use it to analyze some fundamental aspects of mechanism design. We focus on single-item auctions where the values of the bidders are drawn from some (possibly correlated) distribution $mathcal F$. Let $f$ be the allocation function of an optimal mechanism for $mathcal F$. Informally, $S$ is (linearly) rigid in $mathcal F$ if for every mechanism $M'$ with an allocation function $f'$ where $f$ and $f'$ agree on the allocation of at most $x$-fraction of the instances of $S$, the expected revenue of $M'$ is at most an $x$ fraction of the optimal revenue. We use rigidity to explain the singular success of Cremer and McLean's auction. Recall that the revenue of Cremer and McLean's auction is the optimal welfare if the distribution obeys a certain ``full rank'' condition, but no analogous constructions are known if this condition does not hold. Note that the Kolmogorov complexity of the allocation function of Cremer and McLean's auction is logarithmic, whereas we use rigidity to show that for some distributions that do not obey the full rank condition, the Kolmogorov complexity of the allocation function of every mechanism that provides a constant approximation is almost linear. We further investigate rigidity assuming different notions of individual rationality. Assuming ex-post individual rationality, if there is a rigid set, the structure of the optimal mechanism is simple: the player with the highest value ``usually'' wins the item and contributes most of the revenue. In contrast, assuming interim individual rationality, there are distributions with a rigid set $S$ where the optimal mechanism has no obvious allocation pattern (i.e., its Kolmogorov complexity is high). Our results help explain why we have little hope of developing good, simple and generic approximation mechanisms in the interim individual rationality world.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128969264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Clustering Permutations: New Techniques with Streaming Applications 聚类排列:流应用的新技术

Information Technology Convergence and Services Pub Date : 2022-12-04 DOI: 10.48550/arXiv.2212.01821

Diptarka Chakraborty, Debarati Das, Robert Krauthgamer

{"title":"Clustering Permutations: New Techniques with Streaming Applications","authors":"Diptarka Chakraborty, Debarati Das, Robert Krauthgamer","doi":"10.48550/arXiv.2212.01821","DOIUrl":"https://doi.org/10.48550/arXiv.2212.01821","url":null,"abstract":"We study the classical metric $k$-median clustering problem over a set of input rankings (i.e., permutations), which has myriad applications, from social-choice theory to web search and databases. A folklore algorithm provides a $2$-approximate solution in polynomial time for all $k=O(1)$, and works irrespective of the underlying distance measure, so long it is a metric; however, going below the $2$-factor is a notorious challenge. We consider the Ulam distance, a variant of the well-known edit-distance metric, where strings are restricted to be permutations. For this metric, Chakraborty, Das, and Krauthgamer [SODA, 2021] provided a $(2-delta)$-approximation algorithm for $k=1$, where $deltaapprox 2^{-40}$. Our primary contribution is a new algorithmic framework for clustering a set of permutations. Our first result is a $1.999$-approximation algorithm for the metric $k$-median problem under the Ulam metric, that runs in time $(k log (nd))^{O(k)}n d^3$ for an input consisting of $n$ permutations over $[d]$. In fact, our framework is powerful enough to extend this result to the streaming model (where the $n$ input permutations arrive one by one) using only polylogarithmic (in $n$) space. Additionally, we show that similar results can be obtained even in the presence of outliers, which is presumably a more difficult problem.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117133082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Symmetric Formulas for Products of Permutations 排列积的对称公式

Information Technology Convergence and Services Pub Date : 2022-11-28 DOI: 10.48550/arXiv.2211.15520

W. He, Benjamin Rossman

{"title":"Symmetric Formulas for Products of Permutations","authors":"W. He, Benjamin Rossman","doi":"10.48550/arXiv.2211.15520","DOIUrl":"https://doi.org/10.48550/arXiv.2211.15520","url":null,"abstract":"We study the formula complexity of the word problem $mathsf{Word}_{S_n,k} : {0,1}^{kn^2} to {0,1}$: given $n$-by-$n$ permutation matrices $M_1,dots,M_k$, compute the $(1,1)$-entry of the matrix product $M_1cdots M_k$. An important feature of this function is that it is invariant under action of $S_n^{k-1}$ given by [ (pi_1,dots,pi_{k-1})(M_1,dots,M_k) = (M_1pi_1^{-1},pi_1M_2pi_2^{-1},dots,pi_{k-2}M_{k-1}pi_{k-1}^{-1},pi_{k-1}M_k). ] This symmetry is also exhibited in the smallest known unbounded fan-in ${mathsf{AND},mathsf{OR},mathsf{NOT}}$-formulas for $mathsf{Word}_{S_n,k}$, which have size $n^{O(log k)}$. In this paper we prove a matching $n^{Omega(log k)}$ lower bound for $S_n^{k-1}$-invariant formulas computing $mathsf{Word}_{S_n,k}$. This result is motivated by the fact that a similar lower bound for unrestricted (non-invariant) formulas would separate complexity classes $mathsf{NC}^1$ and $mathsf{Logspace}$. Our more general main theorem gives a nearly tight $n^{d(k^{1/d}-1)}$ lower bound on the $G^{k-1}$-invariant depth-$d$ ${mathsf{MAJ},mathsf{AND},mathsf{OR},mathsf{NOT}}$-formula size of $mathsf{Word}_{G,k}$ for any finite simple group $G$ whose minimum permutation representation has degree~$n$. We also give nearly tight lower bounds on the $G^{k-1}$-invariant depth-$d$ ${mathsf{AND},mathsf{OR},mathsf{NOT}}$-formula size in the case where $G$ is an abelian group.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3