default search action
Patrick Briest
Person information
- affiliation: University of Paderborn, Department of Computer Science, Germany
- affiliation: University of Liverpool, Department of Computer Science, UK
- affiliation: TU Dortmund, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j7]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg
:
Pricing lotteries. J. Econ. Theory 156: 144-174 (2015) - 2012
- [j6]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. Algorithmica 62(3-4): 733-753 (2012) - [j5]Patrick Briest, Luciano Gualà
On stackelberg pricing with computationally bounded customers. Networks 60(1): 31-44 (2012) - 2011
- [j4]Patrick Briest, Piotr Krysta:
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. 40(6): 1554-1586 (2011) - [j3]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011) - [c15]Patrick Briest, Christoph Raupach:
The car sharing problem. SPAA 2011: 167-176 - [i8]Patrick Briest, Bastian Degener, Barbara Kempkes, Peter Kling, Peter Pietrzyk:
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model. CoRR abs/1105.1248 (2011) - 2010
- [c14]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg
Pricing Randomized Allocations. SODA 2010: 585-597 - [c13]Patrick Briest, Heiko Röglin
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA 2010: 47-58 - [c12]Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454
2000 – 2009
- 2009
- [j2]Patrick Briest:
Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it Inf. Technol. 51(1): 62-65 (2009) - [c11]Patrick Briest, Martin Hoefer, Luciano Gualà
On Stackelberg Pricing with Computationally Bounded Consumers. WINE 2009: 42-54 - [i7]Patrick Briest, Shuchi Chawla, Robert D. Kleinberg, S. Matthew Weinberg:
Pricing Randomized Allocations. CoRR abs/0904.2400 (2009) - [i6]Patrick Briest, Sanjeev Khanna:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. CoRR abs/0910.0110 (2009) - 2008
- [j1]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? Internet Math. 5(4): 459-475 (2008) - [c10]Patrick Briest:
Uniform Budgets and the Envy-Free Pricing Problem. ICALP (1) 2008: 808-819 - [c9]Moshe Babaioff, Patrick Briest, Piotr Krysta:
On the Approximability of Combinatorial Exchange Problems. SAGT 2008: 83-94 - [c8]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. STACS 2008: 133-142 - [i5]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. CoRR abs/0802.2841 (2008) - [i4]Patrick Briest, Paul W. Goldberg, Heiko Röglin:
Approximate Equilibria in Games with Few Players. CoRR abs/0804.4524 (2008) - 2007
- [b1]Patrick Briest:
Computational aspects of combinatorial pricing problems. Dortmund University, Germany, 2007 - [c7]Patrick Briest, Piotr Krysta:
Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA 2007: 716-725 - [c6]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? WINE 2007: 208-219 - [p1]Patrick Briest:
Algorithmische und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung [Computational Aspects of Combinatorial Pricing Problems]. Ausgezeichnete Informatikdissertationen 2007: 51-60 - [i3]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c5]Patrick Briest, Christian Gunia:
Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. ISAAC 2006: 670-679 - [c4]Patrick Briest, Piotr Krysta:
Single-minded unlimited supply pricing on sparse instances. SODA 2006: 1093-1102 - [i2]Patrick Briest:
Towards Hardness of Envy-Free Pricing. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Patrick Briest, Piotr Krysta:
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c3]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48 - 2004
- [c2]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30 - [c1]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40
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-24 23:12 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: