default search action
Marco Dall'Aglio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Michele Aleandri, Marco Dall'Aglio:
A Coopetition Index for Coalitions in Simple Games. CoRR abs/2407.01383 (2024) - 2023
- [j9]Marco Dall'Aglio
:
Fair division of goods in the shadow of market values. Eur. J. Oper. Res. 307(2): 785-801 (2023) - 2022
- [j8]Michele Aleandri
Minimal winning coalitions and orders of criticality. Ann. Oper. Res. 318(2): 787-803 (2022) - [i6]Michele Aleandri, Marco Dall'Aglio:
A Comparison of Group Criticality Notions for Simple Games. CoRR abs/2207.03565 (2022)
2010 – 2019
- 2019
- [j7]Marco Dall'Aglio, Vito Fragnelli, Stefano Moretti:
Indices of Criticality in Simple Games. IGTR 21(1): 1940003:1-1940003:21 (2019) - [j6]Marco Dall'Aglio, Vito Fragnelli, Stefano Moretti:
Orders of Criticality in Graph Connection Games. Trans. Comput. Collect. Intell. 34: 35-46 (2019) - [i5]Marco Dall'Aglio:
Fair Division of Goods with Market Values. CoRR abs/1910.01615 (2019) - 2017
- [j5]Federica Briata, Andrea Dall'Aglio, Marco Dall'Aglio
The Shapley value in the Knaster gain game. Ann. Oper. Res. 259(1-2): 1-19 (2017) - 2016
- [i4]Federica Briata, Andrea Dall'Aglio, Marco Dall'Aglio, Vito Fragnelli:
The Shapley Value in the Knaster Gain Game. CoRR abs/1602.08068 (2016) - [i3]Marco Dall'Aglio, Camilla Di Luca, Lucia Milone:
Characterizing and Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players. CoRR abs/1606.01028 (2016) - 2014
- [j4]Marco Dall'Aglio
Finding maxmin allocations in cooperative and competitive fair division. Ann. Oper. Res. 223(1): 121-136 (2014) - 2012
- [i2]Theodore P. Hill, Marco Dall'Aglio:
Bayesian Posteriors Without Bayes' Theorem. CoRR abs/1203.0251 (2012) - 2011
- [i1]Marco Dall'Aglio, Camilla Di Luca:
Finding maxmin allocations in cooperative and competitive fair division. CoRR abs/1110.4241 (2011)
2000 – 2009
- 2009
- [j3]Marco Dall'Aglio
Disputed lands. Games Econ. Behav. 66(1): 57-77 (2009) - 2007
- [j2]Marco Dall'Aglio
How to allocate hard candies fairly. Math. Soc. Sci. 54(3): 218-237 (2007) - 2006
- [c1]Stefano Bistarelli
Strategic Games on Defense Trees. Formal Aspects in Security and Trust 2006: 1-15 - 2005
- [j1]Marco Dall'Aglio, Fabio Maccheroni:
Fair Division without Additivity. Am. Math. Mon. 112(4): 363-365 (2005)
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-11 00:13 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: