default search action
Angelina Vidali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j4]Paolo Serafino
, Carmine Ventre
Truthfulness on a budget: trading money for approximation through monitoring. Auton. Agents Multi Agent Syst. 34(1): 5 (2020)
2010 – 2019
- 2019
- [c11]Paolo Serafino, Carmine Ventre, Angelina Vidali:
Truthfulness on a Budget: Trading Money for Approximation through Monitoring. AAMAS 2019: 1234-1242 - 2015
- [c10]Annamária Kovács, Angelina Vidali:
A Characterization of n-Player Strongly Monotone Scheduling Mechanisms. IJCAI 2015: 568-574 - 2014
- [c9]Vincent Conitzer, Angelina Vidali:
Mechanism Design for Scheduling with Uncertain Execution Time. AAAI 2014: 623-629 - 2013
- [j3]Elias Koutsoupias, Angelina Vidali
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica 66(1): 211-223 (2013) - [c8]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali
Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230 - 2012
- [j2]Emmanouil Pountourakis, Angelina Vidali:
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing. Algorithmica 63(4): 831-860 (2012) - [i3]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012) - 2011
- [c7]Monika Henzinger, Angelina Vidali
Multi-parameter Mechanism Design under Budget and Matroid Constraints. ESA 2011: 192-202 - [c6]Angelina Vidali
Extending Characterizations of Truthful Mechanisms from Subdomains to Domains. WINE 2011: 408-414 - 2010
- [c5]Emmanouil Pountourakis, Angelina Vidali
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing. ESA (1) 2010: 146-157 - [i2]Emmanouil Pountourakis, Angelina Vidali:
A complete characterization of group-strategyproof mechanisms of cost-sharing. CoRR abs/1001.1901 (2010)
2000 – 2009
- 2009
- [b1]Angelina Vidali:
Παιγνιοθεωρητική ανάλυση δικτύων. National and Kapodistrian University of Athens, Greece, 2009 - [j1]George Christodoulou
A Lower Bound for Scheduling Mechanisms. Algorithmica 55(4): 729-740 (2009) - [c4]Angelina Vidali
The Geometry of Truthfulness. WINE 2009: 340-350 - 2008
- [c3]George Christodoulou
A Characterization of 2-Player Mechanisms for Scheduling. ESA 2008: 297-307 - [i1]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A characterization of 2-player mechanisms for scheduling. CoRR abs/0807.3427 (2008) - 2007
- [c2]Elias Koutsoupias, Angelina Vidali
A Lower Bound of 1+phi for Truthful Scheduling Mechanisms. MFCS 2007: 454-464 - [c1]George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A lower bound for scheduling mechanisms. SODA 2007: 1163-1170
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:45 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: