Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKostas Kollias
Person information
- affiliation: Google
- affiliation (former): Stanford University, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Dionysia Triantafyllopoulou
, Kostas Kollias, Klaus Moessner:
Price of Anarchy in mmWave Backhaul Routing and Link Scheduling. IEEE Trans. Cogn. Commun. Netw. 10(4): 1496-1510 (2024)- [c37]Kate Donahue, Sreenivas Gollapudi, Kostas Kollias:
When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-Making. AAAI 2024: 10030-10038 - [c36]Alex Zhai, Dee Guo, Sreenivas Gollapudi, Kostas Kollias, Daniel Delling:
Deep Learning-Based Alternative Route Computation. AISTATS 2024: 4078-4086 - [c35]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. AISTATS 2024: 4231-4239 - [c34]Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu:
Network Flow Problems with Electric Vehicles. IPCO 2024: 365-378 - [c33]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar:
Data Exchange Markets via Utility Balancing. WWW 2024: 57-65 - [c32]Sara Ahmadian, Sreenivas Gollapudi, Gregory Hutchins, Kostas Kollias, Xizhi Tan:
Extracting Small Subgraphs in Road Networks. WWW 2024: 493-502 - [c31]Sara Ahmadian, Sreenivas Gollapudi, Kostas Kollias, Vivek Kumar, Ameya Velingker, Santhoshini Velusamy:
Efficient Location Sampling Algorithms for Road Networks. WWW (Companion Volume) 2024: 899-902 - [i13]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar:
Data Exchange Markets via Utility Balancing. CoRR abs/2401.13053 (2024) - [i12]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. CoRR abs/2403.10640 (2024) - 2023
- [j9]Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. ACM Trans. Spatial Algorithms Syst. 9(4): 24:1-24:25 (2023) - [c30]Sreenivas Gollapudi, Kostas Kollias, Chinmay Maheshwari, Manxi Wu:
Online Learning for Traffic Navigation in Congested Networks. ALT 2023: 642-662 - [c29]Dionysia Triantafyllopoulou, Kostas Kollias, Klaus Moessner:
Selfish Routing and Link Scheduling in mmWave Backhaul Networks. ICC 2023: 4200-4205 - [c28]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:
Online Learning and Bandits with Queried Hints. ITCS 2023: 16:1-16:24 - [c27]Eirini Georgoulaki, Kostas Kollias:
Arbitrary Profit Sharing in Federated Learning Utility Games. SAGT 2023: 58-70 - [i11]Pranjal Awasthi, Kush Bhatia, Sreenivas Gollapudi, Kostas Kollias:
Congested Bandits: Optimal Routing via Short-term Resets. CoRR abs/2301.09251 (2023) - [i10]Kate Donahue, Kostas Kollias, Sreenivas Gollapudi:
When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-making. CoRR abs/2308.11721 (2023) - [i9]Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu:
Network Flow Problems with Electric Vehicles. CoRR abs/2311.05040 (2023) - 2022
- [c26]Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl:
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. AAAI 2022: 5059-5067 - [c25]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
The pit stop problem: how to plan your next road trip. SIGSPATIAL/GIS 2022: 47:1-47:9 - [c24]Pranjal Awasthi, Kush Bhatia, Sreenivas Gollapudi, Kostas Kollias:
Congested Bandits: Optimal Routing via Short-term Resets. ICML 2022: 1078-1100 - [c23]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. EC 2022: 529-557 - [c22]Kostas Kollias:
The Pit Stop Problem: How to Plan Your Next Road Trip. WSDM 2022: 1638 - [i8]Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa, Xizhi Tan:
Improved Price of Anarchy via Predictions. CoRR abs/2205.04252 (2022) - [i7]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:
Online Learning and Bandits with Queried Hints. CoRR abs/2211.02703 (2022) - 2021
- [j8]Eirini Georgoulaki, Kostas Kollias, Tami Tamir:
Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems. Algorithms 14(4): 103 (2021) - [c21]Kshipra Bhawalkar, Kostas Kollias, Manish Purohit:
Revenue Maximization in Transportation Networks. APPROX-RANDOM 2021: 26:1-26:16 - [c20]Kostas Kollias, Arun Chandrashekharapuram, Lisa Fawcett, Sreenivas Gollapudi, Ali Kemal Sinop:
Weighted Stackelberg Algorithms for Road Traffic Optimization. SIGSPATIAL/GIS 2021: 57-68 - [c19]Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. SIGSPATIAL/GIS 2021: 282-292 - [c18]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. NeurIPS 2021: 22498-22508 - [c17]Sreenivas Gollapudi, Kostas Kollias, Ali Shameli:
Cost Sharing in Two-Sided Markets. SAGT 2021: 251-265 - [i6]Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias, Pasin Manurangsi, Renato Paes Leme, Jon Schneider:
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms. CoRR abs/2106.04819 (2021) - [i5]Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl:
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment. CoRR abs/2109.06713 (2021) - 2020
- [j7]Martin Gairing, Kostas Kollias, Grammateia Kotsialou:
Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games. ACM Trans. Economics and Comput. 8(2): 11:1-11:28 (2020) - [c16]Aditya Bhaskara, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Adaptive Probing Policies for Shortest Path Routing. NeurIPS 2020 - [c15]Eirini Georgoulaki, Kostas Kollias, Tami Tamir:
Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs. SAGT 2020: 83-98 - [c14]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-Free Repeated Matching in Two-Sided Markets. WINE 2020: 3-16 - [i4]Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut:
Almost Envy-free Repeated Matching in Two-sided Markets. CoRR abs/2009.09336 (2020)
2010 – 2019
- 2019
- [j6]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
The Segmentation-Thickness Tradeoff in Online Marketplaces. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 18:1-18:26 (2019) - [c13]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi:
You Get What You Share: Incentives for a Sharing Economy. AAAI 2019: 2004-2011 - [c12]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
The Segmentation-Thickness Tradeoff in Online Marketplaces. SIGMETRICS (Abstracts) 2019: 31-32 - [c11]Eirini Georgoulaki, Kostas Kollias:
On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems. WINE 2019: 200-213 - [i3]Eirini Georgoulaki, Kostas Kollias:
On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems. CoRR abs/1907.05926 (2019) - 2018
- [c10]Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins:
Orienteering Algorithms for Generating Travel Itineraries. WSDM 2018: 180-188 - [i2]Sreenivas Gollapudi, Kostas Kollias, Ali Shameli:
Cost Sharing in Two-Sided Markets. CoRR abs/1809.02718 (2018) - 2017
- [j5]Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Segmenting two-sided markets. SIGecom Exch. 16(1): 48-52 (2017) - [c9]Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Cost-Sharing in Generalised Selfish Routing. CIAC 2017: 272-284 - [c8]Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika:
Profit Sharing and Efficiency in Utility Games. ESA 2017: 43:1-43:14 - [c7]Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Segmenting Two-Sided Markets. WWW 2017: 63-72 - [i1]Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala:
Two-sided Facility Location. CoRR abs/1711.11392 (2017) - 2016
- [j4]Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden:
Optimal Cost-Sharing in General Resource Selection Games. Oper. Res. 64(6): 1230-1238 (2016) - 2015
- [j3]Konstantinos Kollias, Tim Roughgarden:
Restoring Pure Equilibria to Weighted Congestion Games. ACM Trans. Economics and Comput. 3(4): 21:1-21:24 (2015) - [j2]Dionysia Triantafyllopoulou, Konstantinos Kollias, Klaus Moessner:
QoS and Energy Efficient Resource Allocation in Uplink SC-FDMA Systems. IEEE Trans. Wirel. Commun. 14(6): 3033-3045 (2015) - [c6]Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Tight Bounds for Cost-Sharing in Weighted Congestion Games. ICALP (2) 2015: 626-637 - 2014
- [c5]Vasilis Gkatzelis, Konstantinos Kollias, Tim Roughgarden:
Optimal Cost-Sharing in Weighted Congestion Games. WINE 2014: 72-88 - 2013
- [j1]Konstantinos Kollias:
Nonpreemptive Coordination Mechanisms for Identical Machines. Theory Comput. Syst. 53(3): 424-440 (2013) - 2011
- [c4]Konstantinos Kollias, Tim Roughgarden:
Restoring Pure Equilibria to Weighted Congestion Games. ICALP (2) 2011: 539-551
2000 – 2009
- 2009
- [c3]Rajat Bhattacharjee, Ashish Goel, Konstantinos Kollias:
An incentive-based architecture for social recommendations. RecSys 2009: 229-232 - 2008
- [c2]Vasilis Verroios, Konstantinos Kollias, Panos K. Chrysanthis, Alex Delis:
Adaptive navigation of vehicles in congested road networks. ICPS 2008: 47-56 - [c1]Konstantinos Kollias:
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games. SIROCCO 2008: 197-208
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-08-23 19:28 CEST 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:
