首页 > 最新文献
paperpass

Information Technology Convergence and Services最新文献

英文 中文
Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round 不观察回报就能获胜:利用行为偏差,几乎每局必胜
Pub Date : 2024-03-29 DOI: 10.4230/LIPIcs.ITCS.2024.18
Avrim Blum, Melissa Dutz
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.
人们对各种形式的不确定性下的博弈进行了广泛研究。费尔德曼等人(2010 年)研究了一种信息量特别小的环境,在这种环境中,人们可以观察到对手的行动,但却观察不到回报,甚至连自己的回报也观察不到。面对采用最小最优策略的对手,接近博弈值是我们所能保证的最好结果。然而,行为经济学的大量研究表明,人们往往不会做出完全理性的最优决策。在这里,我们要考虑的是,如果对手在行为上存在偏见,那么在这种情况下是否有可能真正获胜。我们模拟了几个确定性的、有偏见的对手,结果表明,即使事先不知道博弈矩阵,也不观察任何回报,也有可能利用每种偏见赢得几乎每一轮的胜利(只要博弈具有这样的特性,即每种行为都击败并被至少一种其他行为击败)。我们还给出了几乎每局都能获胜的偏置策略的部分特征,并提供了在不知道对手使用哪种策略的情况下击败某些偏置策略的算法。
{"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 克利克网络中的动态最大匹配
Pub Date : 2024-01-28 DOI: 10.4230/LIPIcs.ITCS.2024.73
Minming Li, Peter Robinson, Xianbin Zhu
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.
我们考虑的问题是,在图拓扑发生批量动态变化的情况下,用分布式算法计算最大匹配。我们假设一个由 $n$ 节点组成的图由 $k$ 玩家通过消息传递进行顶点分区。我们的目标是提供一种高效的算法,即使对手确定成批地插入或删除 $ell$ 边,也能快速更新匹配。假设每轮的链接带宽为 $O(betalog n)$ 位,参数为 $beta ge 1$,我们首先展示了重新计算匹配的下限为 $Omega( frac{ell,log k}{beta,k^2log n})$轮,假设对手是一个遗忘者,不知道初始(随机)顶点分区以及玩家的当前状态、以及一个更强的下限:$Omega(frac{ell}{beta,klog n})$轮数来对抗一个自适应对手,这个对手最初可以选择任何平衡的(但不一定是随机的)顶点分割,并且知道玩家的当前状态。我们还提出了一种随机算法,其初始化时间为 $O( lceilfrac{n}{beta,k}rceillog n )$ 轮,而更新时间与 $n$ 无关:更详细地说,更新时间为 $O( lceil frac{ell}{beta,k}rceillog n )$ 轮。rceil log(beta,k))$ 对付一个遗忘对手,他必须提前确定所有更新。如果我们考虑更强的自适应对手,更新时间就会变成 $O( lceil frac{ell}{sqrt{beta,k}}rceil log(beta,k))$ 轮。
{"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 快速确定谁赢得了选举
Pub Date : 2024-01-19 DOI: 10.4230/LIPIcs.ITCS.2024.61
Lisa Hellerstein, Naifeng Liu, Kevin Schewior
This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the voters have made their choices, each vote can be inspected to determine which candidate received that vote. The time (or cost) to inspect each of the votes is known in advance. The task is to (possibly adaptively) determine the order in which to inspect the votes, so as to minimize the expected time to determine which candidate has won the election. We design polynomial-time constant-factor approximation algorithms for both the absolute-majority and the relative-majority version. Both algorithms are based on a two-phase approach. In the first phase, the algorithms reduce the number of relevant candidates to $O(1)$, and in the second phase they utilize techniques from the literature on stochastic function evaluation to handle the remaining candidates. In the case of absolute majority, we show that the same can be achieved with only two rounds of adaptivity.
本文研究的是选民根据已知概率分布各自选择一名候选人的选举。获得绝对多数(绝对或相对,取决于版本)的候选人获胜。选民做出选择后,可以对每张选票进行检查,以确定哪位候选人获得了这一选票。检查每张选票的时间(或成本)是事先已知的。我们的任务是(可能是自适应地)确定检查选票的顺序,从而最大限度地减少确定哪位候选人赢得选举的预期时间。我们为绝对多数票和相对多数票版本设计了多项式时间恒因子近似算法。这两种算法都基于两阶段方法。在第一阶段,算法将相关候选数减少到 $O(1)$;在第二阶段,算法利用随机函数评估文献中的技术来处理剩余的候选数。在绝对多数的情况下,我们证明只需两轮自适应就能达到同样的效果。
{"title":"Quickly Determining Who Won an Election","authors":"Lisa Hellerstein, Naifeng Liu, Kevin Schewior","doi":"10.4230/LIPIcs.ITCS.2024.61","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2024.61","url":null,"abstract":"This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the voters have made their choices, each vote can be inspected to determine which candidate received that vote. The time (or cost) to inspect each of the votes is known in advance. The task is to (possibly adaptively) determine the order in which to inspect the votes, so as to minimize the expected time to determine which candidate has won the election. We design polynomial-time constant-factor approximation algorithms for both the absolute-majority and the relative-majority version. Both algorithms are based on a two-phase approach. In the first phase, the algorithms reduce the number of relevant candidates to $O(1)$, and in the second phase they utilize techniques from the literature on stochastic function evaluation to handle the remaining candidates. In the case of absolute majority, we show that the same can be achieved with only two rounds of adaptivity.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"24 8","pages":"61:1-61:14"},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139613604","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
The Space-Time Cost of Purifying Quantum Computations 净化量子计算的时空成本
Pub Date : 2024-01-15 DOI: 10.4230/LIPIcs.ITCS.2024.102
Mark Zhandry
General quantum computation consists of unitary operations and also measurements. It is well known that intermediate quantum measurements can be deferred to the end of the computation, resulting in an equivalent purely unitary computation. While time efficient, this transformation blows up the space to linear in the running time, which could be super-polynomial for low-space algorithms. Fefferman and Remscrim (STOC'21) and Girish, Raz and Zhan (ICALP'21) show different transformations which are space efficient, but blow up the running time by a factor that is exponential in the space. This leaves the case of algorithms with small-but-super-logarithmic space as incurring a large blowup in either time or space complexity. We show that such a blowup is likely inherent, demonstrating that any"black-box"transformation which removes intermediate measurements must significantly blow up either space or time.
一般量子计算由单元运算和测量组成。众所周知,中间量子测量可以推迟到计算结束时进行,从而产生等效的纯单元计算。虽然时间效率很高,但这种转换会使空间膨胀到线性运行时间,这对于低空间算法来说可能是超多项式的。Fefferman 和 Remscrim(STOC'21)以及 Girish、Raz 和 Zhan(ICALP'21)展示了不同的变换,这些变换在空间上是高效的,但在运行时间上却以空间的指数倍增长。这样一来,空间虽小但超对数的算法在时间或空间复杂度上都会出现大幅膨胀。我们证明了这种膨胀很可能是固有的,任何移除中间测量的 "黑箱 "转换都会显著膨胀空间或时间。
{"title":"The Space-Time Cost of Purifying Quantum Computations","authors":"Mark Zhandry","doi":"10.4230/LIPIcs.ITCS.2024.102","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2024.102","url":null,"abstract":"General quantum computation consists of unitary operations and also measurements. It is well known that intermediate quantum measurements can be deferred to the end of the computation, resulting in an equivalent purely unitary computation. While time efficient, this transformation blows up the space to linear in the running time, which could be super-polynomial for low-space algorithms. Fefferman and Remscrim (STOC'21) and Girish, Raz and Zhan (ICALP'21) show different transformations which are space efficient, but blow up the running time by a factor that is exponential in the space. This leaves the case of algorithms with small-but-super-logarithmic space as incurring a large blowup in either time or space complexity. We show that such a blowup is likely inherent, demonstrating that any\"black-box\"transformation which removes intermediate measurements must significantly blow up either space or time.","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":" 14","pages":"102:1-102:22"},"PeriodicalIF":0.0,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139620786","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
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness 张量、群和多项式的同构问题的复杂性I:张量同构-完备性
Pub Date : 2023-04-26 DOI: 10.4230/LIPIcs.ITCS.2021.31
Joshua A. Grochow, Youming Qiao
We study the complexity of isomorphism problems for tensors, groups, and polynomials. These problems have been studied in multivariate cryptography, machine learning, quantum information, and computational group theory. We show that these problems are all polynomial-time equivalent, creating bridges between problems traditionally studied in myriad research areas. This prompts us to define the complexity class TI, namely problems that reduce to the Tensor Isomorphism (TI) problem in polynomial time. Our main technical result is a polynomial-time reduction from d-tensor isomorphism to 3-tensor isomorphism. In the context of quantum information, this result gives multipartite-to-tripartite entanglement transformation procedure, that preserves equivalence under stochastic local operations and classical communication (SLOCC). 2012 ACM Subject Classification Theory of computation → Complexity classes; Computing methodologies → Linear algebra algorithms; Hardware → Quantum communication and cryptography
我们研究了张量、群和多项式的同构问题的复杂性。这些问题已经在多元密码学、机器学习、量子信息和计算群理论中得到了研究。我们表明,这些问题都是多项式时间等效的,在无数研究领域传统研究的问题之间建立了桥梁。这促使我们定义复杂度类TI,即在多项式时间内简化为张量同构(TI)问题的问题。我们的主要技术成果是从d张量同构到3张量同构的多项式时间化简。在量子信息环境下,该结果给出了在随机局部操作和经典通信(SLOCC)下保持等价的多方到三方纠缠转换过程。2012 ACM学科分类:计算理论→复杂度类;计算方法→线性代数算法;硬件→量子通信和密码
{"title":"On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness","authors":"Joshua A. Grochow, Youming Qiao","doi":"10.4230/LIPIcs.ITCS.2021.31","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2021.31","url":null,"abstract":"We study the complexity of isomorphism problems for tensors, groups, and polynomials. These problems have been studied in multivariate cryptography, machine learning, quantum information, and computational group theory. We show that these problems are all polynomial-time equivalent, creating bridges between problems traditionally studied in myriad research areas. This prompts us to define the complexity class TI, namely problems that reduce to the Tensor Isomorphism (TI) problem in polynomial time. Our main technical result is a polynomial-time reduction from d-tensor isomorphism to 3-tensor isomorphism. In the context of quantum information, this result gives multipartite-to-tripartite entanglement transformation procedure, that preserves equivalence under stochastic local operations and classical communication (SLOCC). 2012 ACM Subject Classification Theory of computation → Complexity classes; Computing methodologies → Linear algebra algorithms; Hardware → Quantum communication and cryptography","PeriodicalId":123734,"journal":{"name":"Information Technology Convergence and Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134008415","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}
引用次数: 27
Differentially Private Continual Releases of Streaming Frequency Moment Estimations 流频率矩估计的差分私有连续释放
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
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.
流计算模型是处理大规模数据的一种流行方法。在此设置中,存在一个项目流,目标是在通过该流并使用尽可能少的空间时计算所需的数量(通常是数据统计)。考虑到数据隐私的重要性,我们开发了连续发布设置下的差分私有流算法,该算法在每个时间戳的输出联合必须是差分私有的。具体来说,我们研究了该设置下的基本$ell_p$$(pin [0,+infty))$频率矩估计问题,并给出了一种$varepsilon$ -DP算法,该算法利用$mathrm{poly}log(Tn)$加性误差实现$(1+eta)$ -相对逼近$(forall etain(0,1))$,使用$mathrm{poly}log(Tn)cdot max(1, n^{1-2/p})$空间,其中$T$为流长度,$n$为元素域的大小。即使在非私人环境中,我们的空间在多对数因子方面也接近最优。为了得到我们的结果,我们首先在差分私有连续释放模型下简化了几个原语,例如计数不同的元素、重磅元素和计数低频元素,以简化为相同设置下的计数/求和问题。基于这些原语,我们开发了一种差分私有持续释放水平集估计方法来解决$ell_p$频率矩估计问题。我们还将结果简单地扩展到较硬的滑动窗口模型,其中必须维护过去$W$数据项的统计信息。
{"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 带预测的图搜索
Pub Date : 2022-12-29 DOI: 10.48550/arXiv.2212.14220
Sid Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhou Li
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.
考虑一个智能体探索一个未知的图来寻找某个目标状态。当它在图上走动时,它学习节点和它们的邻居。智能体只有在达到目标状态时才知道目标状态在哪里。我们如何在只移动一小段距离的情况下达到这个目标?除非我们给agent一些帮助,否则这个问题似乎是没有希望的,即使在有限度的树上也是如此。这种带有“帮助”的设置通常出现在探索大型搜索空间(例如,巨大的游戏树)时,我们假设每个节点都有一些分数/质量函数,我们使用这些函数来引导我们实现目标。在我们的例子中,我们假设帮助以距离预测的形式出现:每个节点$v$提供其到目标顶点距离的预测$f(v)$。当然,如果这些预测是正确的,我们可以沿着最短的路径到达目标。如果预测是不可靠的,其中一些是错误的呢?我们能否得到一种算法,它的性能与预测的误差有关?在这项工作中,我们考虑了树上的问题,并给出了总移动成本仅为$O(OPT + Delta cdot ERR)$的确定性算法,其中$OPT$为从起点到目标顶点的距离,$Delta$为最大度,$ERR$为预测错误的顶点总数。我们证明这种保证是最优的。然后我们考虑问题的“计划”版本,其中图和预测在开始时是已知的,因此代理可以使用该全局信息来设计低成本的搜索策略。对于这个规划版本,我们超越了树,并给出了一个算法,该算法在有界加倍维的(加权)图上获得了良好的性能。
{"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 机构设计中的刚度及其应用
Pub Date : 2022-12-19 DOI: 10.48550/arXiv.2212.09847
Shahar Dobzinski, Ariel Shaulker
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.
我们在拍卖设计中引入刚性的概念,并用它来分析机制设计的一些基本方面。我们专注于单项拍卖,竞标者的价值来自一些(可能相关的)数学分布。设$f$为$ mathicalf $的最优机制的分配函数。非正式地,$S$在$ $ $数学F$ $中是(线性)刚性的,如果对于具有分配函数$ F$的每个机制$M'$,其中$ F$和$ F '$同意分配$S$实例的至多$x$分数,则$M'$的期望收益至多为最优收益的$x$分数。我们用刚性来解释克里默和麦克莱恩拍卖的独特成功。回想一下,Cremer和McLean的拍卖收入是最优福利,如果分配服从某个“满秩”条件,但如果这个条件不成立,则没有类似的结构。请注意,Cremer和McLean拍卖分配函数的Kolmogorov复杂度是对数的,而我们使用刚性来表明,对于一些不服从全秩条件的分布,提供常数近似的每个机制的分配函数的Kolmogorov复杂度几乎是线性的。我们进一步研究刚性假设不同的个人理性的概念。假设事后个人理性,如果存在一个刚性集合,那么最优机制的结构就很简单:拥有最高价值的玩家通常会赢得道具并贡献大部分收益。相反,在临时个体理性假设下,存在刚性集$S$的分布,其中最优机制没有明显的分配模式(即其Kolmogorov复杂度较高)。我们的研究结果有助于解释为什么我们几乎没有希望在过渡个体理性的世界中发展出良好、简单和通用的近似机制。
{"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 聚类排列:流应用的新技术
Pub Date : 2022-12-04 DOI: 10.48550/arXiv.2212.01821
Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
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.
我们研究了一组输入排名(即排列)上的经典度量$k$ -中位数聚类问题,它有无数的应用,从社会选择理论到网络搜索和数据库。民俗算法在多项式时间内为所有$k=O(1)$提供$2$ -近似解,并且无论底层距离度量如何,只要它是度量;然而,低于$2$ -因子是一个臭名昭著的挑战。我们考虑Ulam距离,这是众所周知的编辑距离度量的一个变体,其中字符串被限制为排列。对于这个指标,Chakraborty, Das和Krauthgamer [SODA, 2021]为$k=1$提供了一个$(2-delta)$ -近似算法,其中$deltaapprox 2^{-40}$。我们的主要贡献是一个新的算法框架,用于聚类一组排列。我们的第一个结果是针对Ulam度量下的度量$k$ -中位数问题的$1.999$ -近似算法,该算法在$(k log (nd))^{O(k)}n d^3$时间内运行由$[d]$上的$n$排列组成的输入。事实上,我们的框架足够强大,可以仅使用多对数($n$)空间将此结果扩展到流模型(其中$n$输入排列逐一到达)。此外,我们表明,即使在存在异常值的情况下,也可以获得类似的结果,这可能是一个更困难的问题。
{"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 排列积的对称公式
Pub Date : 2022-11-28 DOI: 10.48550/arXiv.2211.15520
W. He, Benjamin Rossman
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.
我们研究了这个问题的公式复杂度 $mathsf{Word}_{S_n,k} : {0,1}^{kn^2} to {0,1}$给定 $n$-by-$n$ 置换矩阵 $M_1,dots,M_k$,计算 $(1,1)$矩阵乘积的-项 $M_1cdots M_k$. 这个函数的一个重要特征是它在的作用下是不变的 $S_n^{k-1}$ 由 [ (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). ] 这种对称性在已知最小的无界扇形中也表现出来 ${mathsf{AND},mathsf{OR},mathsf{NOT}}$-公式 $mathsf{Word}_{S_n,k}$,它们有大小 $n^{O(log k)}$. 在本文中,我们证明了一个匹配 $n^{Omega(log k)}$ 的下界 $S_n^{k-1}$-不变公式计算 $mathsf{Word}_{S_n,k}$. 这一结果源于这样一个事实,即无限制(非不变)公式的类似下界将分离复杂性类 $mathsf{NC}^1$ 和 $mathsf{Logspace}$. 我们更一般的主要定理给出了一个近似紧密的 $n^{d(k^{1/d}-1)}$ 的下界 $G^{k-1}$不变深度$d$ ${mathsf{MAJ},mathsf{AND},mathsf{OR},mathsf{NOT}}$-公式尺寸 $mathsf{Word}_{G,k}$ 对于任何有限单群 $G$ 谁的最小排列表示有度 $n$. 我们也给出了近似紧的下界 $G^{k-1}$不变深度$d$ ${mathsf{AND},mathsf{OR},mathsf{NOT}}$-公式的大小 $G$ 是一个阿贝尔群。
{"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
期刊
Information Technology Convergence and Services
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1