The power of verification for one-parameter agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better than mechanisms without verification, i.e., those previously considered in the literature. These results are obtained for...
Uložené v:
| Vydané v: | Journal of computer and system sciences Ročník 75; číslo 3; s. 190 - 211 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.05.2009
|
| Predmet: | |
| ISSN: | 0022-0000, 1090-2724 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We initiate the study of mechanisms with
verification for
one-parameter agents. We give an algorithmic
characterization of such mechanisms and show that they are
provably better than mechanisms without verification, i.e., those previously considered in the literature. These results are obtained for a number of optimization problems motivated by the Internet and recently studied in the algorithmic mechanism design literature. The characterization can be regarded as an alternative approach to existing techniques to design
truthful mechanisms. The construction of such mechanisms reduces to the construction of an algorithm satisfying certain “monotonicity” conditions which, for the case of verification, are much less stringent. In other words, verification makes the construction easier and the algorithm more efficient (both computationally and in terms of approximability). |
|---|---|
| AbstractList | We initiate the study of mechanisms with
verification for
one-parameter agents. We give an algorithmic
characterization of such mechanisms and show that they are
provably better than mechanisms without verification, i.e., those previously considered in the literature. These results are obtained for a number of optimization problems motivated by the Internet and recently studied in the algorithmic mechanism design literature. The characterization can be regarded as an alternative approach to existing techniques to design
truthful mechanisms. The construction of such mechanisms reduces to the construction of an algorithm satisfying certain “monotonicity” conditions which, for the case of verification, are much less stringent. In other words, verification makes the construction easier and the algorithm more efficient (both computationally and in terms of approximability). |
| Author | Penna, Paolo Auletta, Vincenzo Persiano, Giuseppe De Prisco, Roberto |
| Author_xml | – sequence: 1 givenname: Vincenzo surname: Auletta fullname: Auletta, Vincenzo email: auletta@dia.unisa.it – sequence: 2 givenname: Roberto surname: De Prisco fullname: De Prisco, Roberto email: robdep@dia.unisa.it – sequence: 3 givenname: Paolo surname: Penna fullname: Penna, Paolo email: penna@dia.unisa.it – sequence: 4 givenname: Giuseppe surname: Persiano fullname: Persiano, Giuseppe email: giuper@dia.unisa.it |
| BookMark | eNp9j01LAzEQhoNUsK3-AU_7B3adTLb7AV6k-AUFL_UcstmJZmk3JQkV_71Z68lD5zLw8j7DPAs2G91IjN1yKDjw6m4oBh1CgQBNCgoAfsHmHFrIscZyxuYAiDmkuWKLEIZU4KtKzBluPyk7uC_ymTPZkbw1Vqto3ZgZl7KR8oPyak8xNdQHjTFcs0ujdoFu_vaSvT89btcv-ebt-XX9sMm1AIg5labiWDartjU1omoqqMSKpmkRTG9q6DrTUStqqhS2JJoeqMRSdIJAG7Fkzemu9i4ET0ZqG39fi17ZneQgJ3c5yMldTu5TltQSiv_Qg7d75b_PQ_cniJLU0ZKXQVsaNfXWk46yd_Yc_gNgx3Ug |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2013_08_047 crossref_primary_10_1007_s00453_021_00847_2 crossref_primary_10_1016_j_tcs_2013_07_034 crossref_primary_10_1145_2189778_2189781 crossref_primary_10_1016_j_tcs_2015_01_001 crossref_primary_10_1007_s00453_020_00796_2 crossref_primary_10_1007_s00453_024_01277_6 crossref_primary_10_1145_2790086 crossref_primary_10_1016_j_geb_2012_09_002 |
| Cites_doi | 10.1145/7531.7535 10.1145/1290672.1290689 10.1002/nav.3800030106 10.1145/301250.301287 10.1007/978-3-540-31856-9_6 10.1007/11561071_55 10.1287/moor.6.1.58 10.1109/SFCS.2001.959924 10.1145/380752.380883 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier Inc. |
| Copyright_xml | – notice: 2008 Elsevier Inc. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jcss.2008.10.001 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 211 |
| ExternalDocumentID | 10_1016_j_jcss_2008_10_001 S0022000008000858 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-e4f61248599f722a860635eeeee920fdf70bbfbe937e6a29e38d0e4243b3e0cf3 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000263385500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sat Nov 29 04:16:26 EST 2025 Tue Nov 18 22:42:19 EST 2025 Fri Feb 23 02:19:42 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Theory of algorithms Algorithmic game theory Mechanism design |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-e4f61248599f722a860635eeeee920fdf70bbfbe937e6a29e38d0e4243b3e0cf3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2008.10.001 |
| PageCount | 22 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_jcss_2008_10_001 crossref_primary_10_1016_j_jcss_2008_10_001 elsevier_sciencedirect_doi_10_1016_j_jcss_2008_10_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-05-01 |
| PublicationDateYYYYMMDD | 2009-05-01 |
| PublicationDate_xml | – month: 05 year: 2009 text: 2009-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2009 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Hochbaum, Shmoys (bib004) 1987; 34 Vazirani (bib013) 2001 A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in: Proc. of Annual European Symposium on Algorithms (ESA), 2005, pp. 616–627 Christos H. Papadimitriou, Algorithms, games, and the internet, in: Proc. of Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 749–753 Koutsoupias, Papadimitriou (bib005) 1999; vol. 1563 Myerson (bib008) 1981; 6 Auletta, De Prisco, Penna, Persiano (bib003) 2007; 3 A. Archer, E. Tardos, Truthful mechanisms for one-parameter agents, in: Proc. of the IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 482–491 Smith (bib012) 1956; 3 N. Andelman, Y. Azar, M. Sorani, Truthful approximation mechanisms for scheduling selfish related machines, in: Proc. of the Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 69–82 Singh, Wittman (bib011) 2001; 6 N. Nisan, A. Ronen, Algorithmic mechanism design, in: Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pp. 129–140 A. Mu'alem, M. Schapira, Setting lower bounds on truthfulness, in: Proc. of Annual ACM Symposium on Discrete Algorithms (SODA), 2007, pp. 1143–1152 10.1016/j.jcss.2008.10.001_bib010 Singh (10.1016/j.jcss.2008.10.001_bib011) 2001; 6 Smith (10.1016/j.jcss.2008.10.001_bib012) 1956; 3 Hochbaum (10.1016/j.jcss.2008.10.001_bib004) 1987; 34 Koutsoupias (10.1016/j.jcss.2008.10.001_bib005) 1999; vol. 1563 10.1016/j.jcss.2008.10.001_bib009 Vazirani (10.1016/j.jcss.2008.10.001_bib013) 2001 10.1016/j.jcss.2008.10.001_bib006 10.1016/j.jcss.2008.10.001_bib007 10.1016/j.jcss.2008.10.001_bib002 Auletta (10.1016/j.jcss.2008.10.001_bib003) 2007; 3 Myerson (10.1016/j.jcss.2008.10.001_bib008) 1981; 6 10.1016/j.jcss.2008.10.001_bib001 |
| References_xml | – volume: vol. 1563 start-page: 404 year: 1999 end-page: 413 ident: bib005 article-title: Worst-case equilibria publication-title: Proc. of Annual Symposium on Theoretical Aspects of Computer Science (STACS) – year: 2001 ident: bib013 article-title: Approximation Algorithms – reference: A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in: Proc. of Annual European Symposium on Algorithms (ESA), 2005, pp. 616–627 – reference: A. Mu'alem, M. Schapira, Setting lower bounds on truthfulness, in: Proc. of Annual ACM Symposium on Discrete Algorithms (SODA), 2007, pp. 1143–1152 – reference: N. Andelman, Y. Azar, M. Sorani, Truthful approximation mechanisms for scheduling selfish related machines, in: Proc. of the Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 69–82 – reference: A. Archer, E. Tardos, Truthful mechanisms for one-parameter agents, in: Proc. of the IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 482–491 – volume: 3 year: 2007 ident: bib003 article-title: Routing selfish unsplittable traffic publication-title: ACM Trans. Algorithms – reference: Christos H. Papadimitriou, Algorithms, games, and the internet, in: Proc. of Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 749–753 – volume: 6 start-page: 63 year: 2001 end-page: 84 ident: bib011 article-title: Implementation with partial verification publication-title: Rev. Econ. Des. – reference: N. Nisan, A. Ronen, Algorithmic mechanism design, in: Proc. of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pp. 129–140 – volume: 6 start-page: 58 year: 1981 end-page: 73 ident: bib008 article-title: Optimal auction design publication-title: Math. Oper. Res. – volume: 3 start-page: 59 year: 1956 end-page: 66 ident: bib012 article-title: Various optimizer for single-stage production publication-title: Naval Res. Logist. Quat. – volume: 34 start-page: 144 year: 1987 end-page: 162 ident: bib004 article-title: Using dual approximation algorithms for scheduling problems: Theoretical and practical results publication-title: J. ACM – volume: 34 start-page: 144 year: 1987 ident: 10.1016/j.jcss.2008.10.001_bib004 article-title: Using dual approximation algorithms for scheduling problems: Theoretical and practical results publication-title: J. ACM doi: 10.1145/7531.7535 – volume: 3 issue: 4 year: 2007 ident: 10.1016/j.jcss.2008.10.001_bib003 article-title: Routing selfish unsplittable traffic publication-title: ACM Trans. Algorithms doi: 10.1145/1290672.1290689 – volume: 3 start-page: 59 year: 1956 ident: 10.1016/j.jcss.2008.10.001_bib012 article-title: Various optimizer for single-stage production publication-title: Naval Res. Logist. Quat. doi: 10.1002/nav.3800030106 – ident: 10.1016/j.jcss.2008.10.001_bib009 doi: 10.1145/301250.301287 – ident: 10.1016/j.jcss.2008.10.001_bib001 doi: 10.1007/978-3-540-31856-9_6 – ident: 10.1016/j.jcss.2008.10.001_bib006 doi: 10.1007/11561071_55 – ident: 10.1016/j.jcss.2008.10.001_bib007 – year: 2001 ident: 10.1016/j.jcss.2008.10.001_bib013 – volume: 6 start-page: 58 year: 1981 ident: 10.1016/j.jcss.2008.10.001_bib008 article-title: Optimal auction design publication-title: Math. Oper. Res. doi: 10.1287/moor.6.1.58 – volume: 6 start-page: 63 issue: 1 year: 2001 ident: 10.1016/j.jcss.2008.10.001_bib011 article-title: Implementation with partial verification publication-title: Rev. Econ. Des. – ident: 10.1016/j.jcss.2008.10.001_bib002 doi: 10.1109/SFCS.2001.959924 – volume: vol. 1563 start-page: 404 year: 1999 ident: 10.1016/j.jcss.2008.10.001_bib005 article-title: Worst-case equilibria – ident: 10.1016/j.jcss.2008.10.001_bib010 doi: 10.1145/380752.380883 |
| SSID | ssj0011563 |
| Score | 1.9847859 |
| Snippet | We initiate the study of mechanisms with
verification for
one-parameter agents. We give an algorithmic
characterization of such mechanisms and show that they... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 190 |
| SubjectTerms | Algorithmic game theory Mechanism design Theory of algorithms |
| Title | The power of verification for one-parameter agents |
| URI | https://dx.doi.org/10.1016/j.jcss.2008.10.001 |
| Volume | 75 |
| WOSCitedRecordID | wos000263385500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1090-2724 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9NAEF2FlgMcKBQQhYL2wC0y2i_H3mOESgtCVQ6lys3yrtcoUbGtfFQV_4B_zax313agqgCJHKzI8cbJzvPMs_fNDEJvi5gazUkeKSFNJEQhI6UnMjJcU6qo0KqtxHT5OTk_T-dzORuNfoRcmOurpKrSmxvZ_FdTwz4wtk2d_Qtzd18KO-A9GB22YHbY_rHhG9v7zPJA-PVWC9QrCuvKRLbc9zcrgxnnX0Mpp1sIqvYNH9r1BVfxeewDZkfEp1uwuyOglwv4oPped9TYjGfgQXTdC7jr3hFXLhdtloPz7feubEpnO-B0sV2bpjE7TyVkrwF0j8pCusyOmrNNHbAR0gUf53GJJBFLXCJ1cMmumYqHHh_4VyrJIFQz56d_iwLugcTy3VKv104u2wr4aB_zOiWiXaxmxDNnoJ_pPbTPkliCg9yffjyZf-qWpOBGl4fS8_Z4n4HlxIK_nul2ljNgLheP0SNvUTx1UHmCRqY6RAehnQf23v0QPRzUpnyKGOAItzjCdYmHOMKAI7yDI-xw9Ax9-XBy8f4s8g02Irg8ySYyogSCK1L4u2XCWJ7C3SyPjX1JRsqiTIhSpTJAYc0kZ9LwtCBGMMEVN0SX_Dnaq-B8LxDmSVkUSSFyNSmFZkJNaE5lrlPFGYSI-AjRMCGZ9tXnbROUqyzIDJeZnUTXFpXamrX0CI27MY2rvXLn0XGY58xfDI4VZgCLO8a9_Mdxr9CDHvjHaG-z2prX6L6-3izWqzcePT8BcIOU7g |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+power+of+verification+for+one-parameter+agents&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Auletta%2C+Vincenzo&rft.au=De+Prisco%2C+Roberto&rft.au=Penna%2C+Paolo&rft.au=Persiano%2C+Giuseppe&rft.date=2009-05-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=75&rft.issue=3&rft.spage=190&rft.epage=211&rft_id=info:doi/10.1016%2Fj.jcss.2008.10.001&rft.externalDocID=S0022000008000858 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |