Остановите войну!
for scientists:
default search action
Ulrich Pferschy
- > Home > Persons > Ulrich Pferschy
Publications
- 2021
- [j63]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer:
On the Stackelberg knapsack game. Eur. J. Oper. Res. 291(1): 18-31 (2021) - [j61]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a Last-In-First-Out buffer. J. Sched. 24(6): 663-680 (2021) - [i11]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch, Giovanni Righini:
Optimally rescheduling jobs with a LIFO buffer. CoRR abs/2106.15901 (2021) - 2019
- [j55]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
A Stackelberg knapsack game with weight control. Theor. Comput. Sci. 799: 149-159 (2019) - 2018
- [j54]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Competitive multi-agent scheduling with an iterative selection rule. 4OR 16(1): 15-29 (2018) - [j52]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. Electron. Notes Discret. Math. 69: 133-140 (2018) - [i8]Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici:
On a Stackelberg Subset Sum Game. CoRR abs/1801.03698 (2018) - 2017
- [j45]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3): 933-943 (2017) - 2016
- [j43]Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness in Project Budget Allocation. Electron. Notes Discret. Math. 55: 65-68 (2016) - [c29]Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness-profit Tradeoff in Project Budget Allocation. CENTERIS/ProjMAN/HCist 2016: 313-320 - [c28]Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Bernhard Leder:
A Simulation study of Fairness-Profit Trade-off in Project Selection based on HHI and Knapsack Models. EMS 2016: 85-90 - 2015
- [j40]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3): 243-261 (2015) - [j39]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two agent scheduling with a central selection mechanism. Theor. Comput. Sci. 596: 109-123 (2015) - [c26]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Brief Announcement: On the Fair Subset Sum Problem. SAGT 2015: 309-311 - [i4]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Multiagent Subset Sum Problems. CTW 2015: 55-58 - [i2]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Allocating a Bounded Resource. CoRR abs/1508.05253 (2015) - 2013
- [j37]Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Strategies in competing subset selection. Ann. Oper. Res. 207(1): 181-200 (2013) - [c22]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two Agents Competing for a Shared Machine. ADT 2013: 1-14 - 2012
- [c20]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Strategies for Single-machine Multi-agent Scheduling Problems. CTW 2012: 197-200 - 2011
- [j31]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Competitive subset selection with two agents. Discret. Appl. Math. 159(16): 1865-1877 (2011) - 2009
- [c16]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Subset Weight Maximization with Two Competing Agents. ADT 2009: 74-85 - [c14]Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
On Multi-Agent Knapsack Problems. CTW 2009: 44-47
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-03-19 02:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint