default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Marbach
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Ryan J. Kinnear
, Ravi R. Mazumdar, Peter Marbach:
Convexity in Real-time Bidding and Related Problems. ACM Trans. Economics and Comput. 12(2): 7 (2024)- [i12]Junwei Su, Peter Marbach:
The Role of Social Support and Influencers in Social Media Communities. CoRR abs/2410.04619 (2024) - 2023
- [j14]Junwei Su, Peter Marbach:
Structural Properties of Core-periphery Communities. Adv. Complex Syst. 26(6): 2340004:1-2340004:43 (2023) - 2022
- [c40]Junwei Su, Peter Marbach:
Structure of Core-Periphery Communities. COMPLEX NETWORKS (2) 2022: 151-161 - [c39]Ryan J. Kinnear, Ravi R. Mazumdar, Peter Marbach:
Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms. SIGMETRICS (Abstracts) 2022: 93-94 - [i11]Ryan J. Kinnear, Ravi R. Mazumdar, Peter Marbach:
Convexity and Duality in Optimum Real-time Bidding and Related Problems. CoRR abs/2206.12408 (2022) - [i10]Junwei Su, Peter Marbach:
Structure of Core-Periphery Communities. CoRR abs/2207.06964 (2022) - 2021
- [j13]Ryan J. Kinnear, Ravi R. Mazumdar, Peter Marbach:
Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms. Proc. ACM Meas. Anal. Comput. Syst. 5(3): 37:1-37:37 (2021) - [i9]Ryan J. Kinnear, Ravi R. Mazumdar, Peter Marbach:
Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and Algorithms. CoRR abs/2111.08621 (2021) - 2020
- [j12]Erik Tillberg, Peter Marbach, Ravi Mazumdar:
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria. Proc. ACM Meas. Anal. Comput. Syst. 4(2): 34:1-34:55 (2020) - [c38]Larry Yueli Zhang, Peter Marbach:
Efficient Community Detection by Exploiting Structural Properties of Real-World User-Item Graphs. COMPLEX NETWORKS (1) 2020: 15-26 - [c37]Erik Tillberg, Peter Marbach, Ravi Mazumdar:
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria. SIGMETRICS (Abstracts) 2020: 109-110 - [c36]Boxuan Li, Martin Carrington, Peter Marbach:
Stable Community Structures and Social Exclusion. SocInfo 2020: 168-180 - [c35]Peter Marbach:
Community Structures in Information Networks for a Discrete Agent Population. WAW 2020: 158-172 - [i8]Peter Marbach:
Community Structures in Information Networks for a Discrete Agent Population. CoRR abs/2004.05708 (2020) - [i7]Erik Tillberg, Peter Marbach, Ravi Mazumdar:
Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria. CoRR abs/2004.07190 (2020) - [i6]Boxuan Li, Martin Carrington, Peter Marbach:
Stable Community Structures and Social Exclusion. CoRR abs/2007.14515 (2020) - [i5]Ryan J. Kinnear, Ravi R. Mazumdar, Peter Marbach:
Optimal Real-time Bidding Policies for Contract Fulfillment in Second Price Auctions. CoRR abs/2012.10001 (2020)
2010 – 2019
- 2019
- [c34]Martin Carrington, Peter Marbach:
Community Structures in Information Networks. GAMENETS 2019: 119-127 - 2018
- [i4]Larry Yueli Zhang, Peter Marbach:
Stable and Efficient Structures for the Content Production and Consumption in Information Communities. CoRR abs/1801.04642 (2018) - 2016
- [c33]Peter Marbach:
The structure of communities in information networks. ITA 2016: 1-6 - 2015
- [i3]Peter Marbach:
Modeling and Analysis of Information Communities. CoRR abs/1511.08904 (2015) - 2014
- [c32]Larry Yueli Zhang, Peter Marbach:
Microscopic generative models for complex networks. CISS 2014: 1-6 - 2013
- [j11]Gabriel Scalosub, Peter Marbach, Jörg Liebeherr:
Buffer Management for Aggregated Streaming Data with Packet Dependencies. IEEE Trans. Parallel Distributed Syst. 24(3): 439-449 (2013) - 2012
- [c31]Felix Ming, Fai Wong, Peter Marbach:
Similarity-based network formation. Allerton Conference 2012: 394-399 - [c30]Felix Ming, Fai Wong, Peter Marbach:
Cosine-neighbourhood-refinement: Towards a robust network formation mechanism. INFOCOM 2012: 1710-1718 - 2011
- [j10]Peter Marbach, Atilla Eryilmaz, Asuman E. Ozdaglar:
Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints. IEEE Trans. Inf. Theory 57(6): 3644-3676 (2011) - [c29]Lilin Zhang, Peter Marbach:
"Two Is a Crowd" - Optimal Trend Adoption in Social Networks. GAMENETS 2011: 608-627 - [c28]Felix Ming, Fai Wong, Peter Marbach:
"Who Are Your Friends?" - A Simple Mechanism that achieves perfect network formation. INFOCOM 2011: 566-570 - [c27]Mahdi Lotfinezhad, Peter Marbach:
Throughput-optimal random access with order-optimal delay. INFOCOM 2011: 2867-2875 - 2010
- [c26]Gabriel Scalosub, Peter Marbach, Jörg Liebeherr:
Buffer Management for Aggregated Streaming Data with Packet Dependencies. INFOCOM 2010: 241-245 - [c25]Mahdi Lotfinezhad, Peter Marbach:
Delay performance of CSMA policies in multihop wireless networks: A new perspective. ITA 2010: 292-299 - [c24]Michael Mathioudakis, Nick Koudas, Peter Marbach:
Early online identification of attention gathering items in social media. WSDM 2010: 301-310 - [i2]Mahdi Lotfinezhad, Peter Marbach:
Throughput-Optimal Random Access with Order-Optimal Delay. CoRR abs/1009.5944 (2010)
2000 – 2009
- 2009
- [j9]Milan Vojnovic, James R. Cruise, Dinan Gunawardena, Peter Marbach:
Ranking and Suggesting Popular Items. IEEE Trans. Knowl. Data Eng. 21(8): 1133-1146 (2009) - [c23]Mahdi Lotfinezhad, Peter Marbach:
On channel access delay of CSMA policies in wireless networks with primary interference constraints. Allerton 2009: 469-476 - [c22]Mohammad Hossein Manshaei, Peter Marbach, Jean-Pierre Hubaux:
Evolution and market share of wireless community networks. GAMENETS 2009: 508-514 - [c21]Stratis Ioannidis, Peter Marbach:
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search. INFOCOM 2009: 576-584 - 2008
- [j8]Peter Marbach:
Transmission costs, selfish nodes, and protocol design. Wirel. Networks 14(5): 615-631 (2008) - [c20]Peter Marbach, Atilla Eryilmaz:
A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks. Allerton 2008: 768-775 - [c19]Peter Marbach:
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering. CISS 2008: 292-297 - [c18]Mohammad Hossein Manshaei, Julien Freudiger, Márk Félegyházi, Peter Marbach, Jean-Pierre Hubaux:
On Wireless Social Community Networks. INFOCOM 2008: 1552-1560 - [c17]Stratis Ioannidis, Peter Marbach:
On the design of hybrid peer-to-peer systems. SIGMETRICS 2008: 157-168 - [c16]Atilla Eryilmaz, Peter Marbach, Asuman E. Ozdaglar:
A fluid-flow model for backlog-based CSMA policies. WICON 2008: 77 - 2007
- [c15]Peter Marbach, Atilla Eryilmaz, Asuman E. Ozdaglar:
Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints. CDC 2007: 1156-1161 - [c14]Peter Marbach:
Distributed Scheduling and Active Queue Management in Wireless Networks. INFOCOM 2007: 2321-2325 - 2006
- [c13]Peter Marbach, Yiyi Lu:
Active Queue Management and Scheduling for Wireless Networks: The Single-Cell Case. CISS 2006: 1560-1565 - [c12]Stratis Ioannidis, Peter Marbach:
A Brownian Motion Model for Last Encounter Routing. INFOCOM 2006 - [c11]Yiping Gong, Peter Marbach:
Interaction of rate and medium access control in wireless networks: : the single cell case. MobiHoc 2006: 178-189 - [i1]S. M. Nazrul Alam, Peter Marbach:
Competition and Request Routing Policies in Content Delivery Networks. CoRR abs/cs/0608082 (2006) - 2005
- [j7]Clement Yuen, Peter Marbach:
Price-based rate control in random access networks. IEEE/ACM Trans. Netw. 13(5): 1027-1040 (2005) - [j6]Peter Marbach, Ying Qiu:
Cooperation in wireless ad hoc networks: a market-based approach. IEEE/ACM Trans. Netw. 13(6): 1325-1338 (2005) - [c10]Peter Marbach, Ran Pang:
Transmission Costs, Selfish Nodes, and Protocol Design. WiOpt 2005: 31-40 - [c9]Stratis Ioannidis, Peter Marbach:
Towards an Understanding of EASE and Its Properties. WiOpt 2005: 267-276 - 2004
- [j5]Peter Marbach:
Analysis of a static pricing scheme for priority services. IEEE/ACM Trans. Netw. 12(2): 312-325 (2004) - [c8]Peter Marbach:
Rate control for random access networks: The finite node case. CDC 2004: 2842-2847 - 2003
- [j4]Peter Marbach, John N. Tsitsiklis:
Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Processes. Discret. Event Dyn. Syst. 13(1-2): 111-148 (2003) - [j3]Peter Marbach:
Priority service and max-min fairness. IEEE/ACM Trans. Netw. 11(5): 733-746 (2003) - [c7]Xinran Wu, Peter Marbach:
Pricing and rate adaptation in a non-cooperative environment. CDC 2003: 2088-2093 - [c6]Ying Qiu, Peter Marbach:
Bandwidth Allocation in Wireless Ad Hoc Networks: A Price-Based Approach. INFOCOM 2003: 797-807 - 2002
- [c5]Peter Marbach:
Priority Service and Max-Min Fairness. INFOCOM 2002: 266-275 - [c4]Peter Marbach, Randall A. Berry:
Downlink Resource Allocation and Pricing for Wireless Networks. INFOCOM 2002: 1470-1479 - 2001
- [j2]Peter Marbach, John N. Tsitsiklis:
Simulation-based optimization of Markov reward processes. IEEE Trans. Autom. Control. 46(2): 191-209 (2001) - [c3]Peter Marbach:
Pricing Differentiated Services Networks: Bursty Traffic. INFOCOM 2001: 650-658 - 2000
- [j1]Peter Marbach, Oliver Mihatsch, John N. Tsitsiklis:
Call admission control and routing in integrated services networks using neuro-dynamic programming. IEEE J. Sel. Areas Commun. 18(2): 197-208 (2000)
1990 – 1999
- 1998
- [b1]Peter Marbach:
Simulation-based optimization of Markov decision processes. Massachusetts Institute of Technology, Cambridge, MA, USA, 1998 - 1997
- [c2]Peter Marbach, John N. Tsitsiklis:
A neuro-dynamic programming approach to admission control in ATM networks: the single link case. ICASSP 1997: 159-162 - [c1]Peter Marbach, Oliver Mihatsch, Miriam Schulte, John N. Tsitsiklis:
Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks. NIPS 1997: 922-928
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
