随机顺序模型中在线线性打包覆盖问题的真实近优机制

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2024-04-05 DOI:10.1016/j.ic.2024.105167

Jinshan Zhang , Xiaoye Miao , Meng Xi , Tianyu Du , Jianwei Yin

{"title":"随机顺序模型中在线线性打包覆盖问题的真实近优机制","authors":"Jinshan Zhang , Xiaoye Miao , Meng Xi , Tianyu Du , Jianwei Yin","doi":"10.1016/j.ic.2024.105167","DOIUrl":null,"url":null,"abstract":"<div><p>Our focus is on the online linear packing-covering problem (OLPCP). Within this domain, we present an algorithm that attains near-optimal performance based on generalized Chernoff bounds for general random variables, assuming inputs are received in a uniformly random order and under almost stringent conditions. Through VCG protocols, we are able to unveil the inaugural truthful near-optimal mechanism for OLPCP, all within the confines of nearly tight conditions.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105167"},"PeriodicalIF":0.8000,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A truthful near-optimal mechanism for online linear packing-covering problem in the random order model\",\"authors\":\"Jinshan Zhang , Xiaoye Miao , Meng Xi , Tianyu Du , Jianwei Yin\",\"doi\":\"10.1016/j.ic.2024.105167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Our focus is on the online linear packing-covering problem (OLPCP). Within this domain, we present an algorithm that attains near-optimal performance based on generalized Chernoff bounds for general random variables, assuming inputs are received in a uniformly random order and under almost stringent conditions. Through VCG protocols, we are able to unveil the inaugural truthful near-optimal mechanism for OLPCP, all within the confines of nearly tight conditions.</p></div>\",\"PeriodicalId\":54985,\"journal\":{\"name\":\"Information and Computation\",\"volume\":\"298 \",\"pages\":\"Article 105167\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0890540124000324\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540124000324","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们的重点是在线线性打包覆盖问题（OLPCP）。在这一领域中，我们提出了一种算法，该算法基于一般随机变量的广义切尔诺夫边界，假定输入以均匀随机的顺序接收，并在几乎苛刻的条件下实现了接近最优的性能。通过 VCG 协议，我们能够在近乎苛刻的条件下，为 OLPCP 揭开真实近优机制的序幕。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A truthful near-optimal mechanism for online linear packing-covering problem in the random order model

Our focus is on the online linear packing-covering problem (OLPCP). Within this domain, we present an algorithm that attains near-optimal performance based on generalized Chernoff bounds for general random variables, assuming inputs are received in a uniformly random order and under almost stringent conditions. Through VCG protocols, we are able to unveil the inaugural truthful near-optimal mechanism for OLPCP, all within the confines of nearly tight conditions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking