default search action
Peter McGlaughlin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Jugal Garg, Peter McGlaughlin, Martin Hoefer, Marco Schmalhofer:
Competitive Equilibria with a Constant Number of Chores. J. Artif. Intell. Res. 78: 1201-1219 (2023) - [j2]Bhaskar Ray Chaudhury, Jugal Garg
, Peter McGlaughlin, Ruta Mehta:
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna. Math. Oper. Res. 48(3): 1630-1656 (2023) - 2022
- [c9]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
On the Existence of Competitive Equilibrium with Chores. ITCS 2022: 41:1-41:13 - [c8]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. EC 2022: 1106-1107 - [i3]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness. CoRR abs/2205.11363 (2022) - 2021
- [c7]Jugal Garg, Martin Hoefer, Peter McGlaughlin, Marco Schmalhofer:
When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores. SAGT 2021: 329-344 - [c6]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. SODA 2021: 1405-1424 - 2020
- [j1]Peter McGlaughlin, Jugal Garg:
Improving Nash Social Welfare Approximations. J. Artif. Intell. Res. 68: 225-245 (2020) - [c5]Jugal Garg, Peter McGlaughlin:
Computing Competitive Equilibria with Mixed Manna. AAMAS 2020: 420-428 - [i2]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores. CoRR abs/2008.00285 (2020) - [i1]Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
Competitive Allocation of a Mixed Manna. CoRR abs/2008.02753 (2020)
2010 – 2019
- 2019
- [c4]Jugal Garg, Peter McGlaughlin:
Improving Nash Social Welfare Approximations. IJCAI 2019: 294-300 - [c3]Jugal Garg, Peter McGlaughlin, Setareh Taki:
Approximating Maximin Share Allocations. SOSA 2019: 20:1-20:11 - 2018
- [c2]Jugal Garg, Peter McGlaughlin:
A Truthful Mechanism for Interval Scheduling. SAGT 2018: 100-112 - 2016
- [c1]Peter McGlaughlin, Alexandra Chronopoulou:
Discretization error of reflected fractional Brownian motion. WSC 2016: 270-276
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-04-25 05:39 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: