{"id":"https://openalex.org/W2111561907","doi":"https://doi.org/10.1109/infcom.2009.5062008","title":"On Mechanism Design without Payments for Throughput Maximization","display_name":"On Mechanism Design without Payments for Throughput Maximization","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2111561907","doi":"https://doi.org/10.1109/infcom.2009.5062008","mag":"2111561907"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5062008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041937385","display_name":"Thomas Moscibroda","orcid":"https://orcid.org/0000-0002-8729-7841"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. Moscibroda","raw_affiliation_strings":["Microsoft Res., Syst. & Networking Res. Group, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Res., Syst. & Networking Res. Group, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S. Schmid","raw_affiliation_strings":["Efficient Algorithms, Technical University Munich, Munich, Germany","[Efficient Algorithms, Technical University Munich, Munich, Germany]"],"affiliations":[{"raw_affiliation_string":"Efficient Algorithms, Technical University Munich, Munich, Germany","institution_ids":[]},{"raw_affiliation_string":"[Efficient Algorithms, Technical University Munich, Munich, Germany]","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041937385"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":3.6255,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93343786,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"972","last_page":"980"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/payment","display_name":"Payment","score":0.8152844905853271},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.7967666387557983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7091041207313538},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5965152978897095},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.570450484752655},{"id":"https://openalex.org/keywords/transaction-cost","display_name":"Transaction cost","score":0.5446351170539856},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5220094323158264},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.4337315261363983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3632078468799591},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.23852887749671936},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21830442547798157},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.17096397280693054},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.14543011784553528},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.1418675184249878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13321632146835327},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.12295970320701599}],"concepts":[{"id":"https://openalex.org/C145097563","wikidata":"https://www.wikidata.org/wiki/Q1148747","display_name":"Payment","level":2,"score":0.8152844905853271},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.7967666387557983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7091041207313538},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5965152978897095},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.570450484752655},{"id":"https://openalex.org/C98965940","wikidata":"https://www.wikidata.org/wiki/Q877496","display_name":"Transaction cost","level":2,"score":0.5446351170539856},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5220094323158264},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.4337315261363983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3632078468799591},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.23852887749671936},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21830442547798157},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.17096397280693054},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.14543011784553528},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.1418675184249878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13321632146835327},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.12295970320701599},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2009.5062008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.1870","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.1870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/en-us/um/people/moscitho/Publications/Infocom09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1521505907","https://openalex.org/W1535062948","https://openalex.org/W1775886520","https://openalex.org/W2020183851","https://openalex.org/W2036910311","https://openalex.org/W2070029286","https://openalex.org/W2083453305","https://openalex.org/W2103397552","https://openalex.org/W2104272554","https://openalex.org/W2112794046","https://openalex.org/W2114071635","https://openalex.org/W2129678216","https://openalex.org/W2152707007","https://openalex.org/W2167101557","https://openalex.org/W2171735304","https://openalex.org/W2199385070","https://openalex.org/W2216069195","https://openalex.org/W2294046754","https://openalex.org/W2508573783","https://openalex.org/W4230906437","https://openalex.org/W6631379509","https://openalex.org/W6638202807","https://openalex.org/W6655766394","https://openalex.org/W6668190637"],"related_works":["https://openalex.org/W1536727859","https://openalex.org/W3124009333","https://openalex.org/W2417737453","https://openalex.org/W2373220065","https://openalex.org/W2233476005","https://openalex.org/W2089073576","https://openalex.org/W2787993192","https://openalex.org/W3125714252","https://openalex.org/W2341580512","https://openalex.org/W3037957060"],"abstract_inverted_index":{"It":[0],"is":[1],"well-known":[2],"that":[3,28,96,119],"the":[4,14,30,71,81,93,111,124,130],"overall":[5],"efficiency":[6],"of":[7,37,73,83],"a":[8,138],"distributed":[9],"system":[10],"can":[11,97],"suffer":[12],"if":[13],"participating":[15],"entities":[16],"seek":[17],"to":[18,32,52],"maximize":[19],"their":[20],"individual":[21],"performance.":[22],"Consequently,":[23],"mechanisms":[24,74],"have":[25],"been":[26],"designed":[27],"force":[29],"participants":[31],"behave":[33],"more":[34],"cooperatively.":[35],"Most":[36],"these":[38],"game-theoretic":[39],"solutions":[40],"rely":[41],"on":[42],"payments":[43,48],"between":[44],"participants.":[45],"Unfortunately,":[46],"such":[47],"are":[49,64,145],"often":[50],"cumbersome":[51],"implement":[53],"in":[54,57,86,123],"practice,":[55],"especially":[56],"dynamic":[58],"networks":[59],"and":[60,89,101,106,129],"where":[61,116,135],"transaction":[62],"costs":[63],"high.":[65],"In":[66],"this":[67],"paper,":[68],"we":[69,117],"investigate":[70],"potential":[72],"which":[75],"work":[76],"without":[77,102],"payments.":[78,103],"We":[79,104],"consider":[80],"problem":[82],"throughput":[84,94],"maximization":[85],"multi-channel":[87],"environments":[88],"shed":[90],"light":[91],"onto":[92],"increase":[95],"be":[98],"achieved":[99],"with":[100],"introduce":[105],"analyze":[107],"two":[108],"different":[109],"concepts:":[110],"worst-case":[112],"<i":[113,132],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[114,133],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">leverage</i>":[115,134],"assume":[118],"players":[120],"end":[121],"up":[122],"worst":[125],"rational":[126],"strategy":[127],"profile,":[128],"average-case":[131],"player":[136],"select":[137],"random":[139],"non-dominated":[140],"strategy.":[141],"Our":[142],"theoretical":[143],"insights":[144],"complemented":[146],"by":[147],"simulations.":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}