| 1. | Sankarshan Damle; Aleksei Triastcyn; Boi Faltings; Sujit Gujar: Differentially Private Multi-Agent Constraint Optimization. To Appear in the Proceeding of The 20th IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT '21), Forthcoming. (Type: Conference | BibTeX | Tags: differential privacy, distributed constrained optimization)@conference{Damle2021c,
title = {Differentially Private Multi-Agent Constraint Optimization},
author = {Sankarshan Damle and Aleksei Triastcyn and Boi Faltings and Sujit Gujar},
year = {2021},
date = {2021-12-14},
booktitle = {To Appear in the Proceeding of The 20th IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT '21)},
keywords = {differential privacy, distributed constrained optimization},
pubstate = {forthcoming},
tppubtype = {conference}
}
|
| 2. | Sankarshan Damle; Boi Faltings; Sujit Gujar: Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions. In: To Appear in the Proceeding of The 20th IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT '21), Forthcoming. (Type: Conference | BibTeX | Tags: Blockchain, combinatorial auction, cryptography, Privacy, Security)@inproceedings{Damle2021d,
title = {Blockchain-based Practical Multi-agent Secure Comparison and its Application in Auctions},
author = {Sankarshan Damle and Boi Faltings and Sujit Gujar},
year = {2021},
date = {2021-12-14},
booktitle = {To Appear in the Proceeding of The 20th IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT '21)},
keywords = {Blockchain, combinatorial auction, cryptography, Privacy, Security},
pubstate = {forthcoming},
tppubtype = {inproceedings}
}
|
| 3. | Sankarshan Damle; Aleksei Triastcyn; Boi Faltings; Sujit Gujar: Differentially Private Multi-Agent Constraint Optimization. The Second AAAI Workshop on Privacy-Preserving Artificial Intelligence (PPAI-21), 2021. (Type: Workshop | Abstract | Links | BibTeX | Tags: differential privacy)@workshop{Damle2021b,
title = {Differentially Private Multi-Agent Constraint Optimization},
author = {Sankarshan Damle and Aleksei Triastcyn and Boi Faltings and Sujit Gujar},
editor = {Ferdinando Fioretto},
url = {https://ppai21.github.io/files/38-paper.pdf},
year = {2021},
date = {2021-02-08},
booktitle = {The Second AAAI Workshop on Privacy-Preserving Artificial Intelligence (PPAI-21)},
abstract = {Several optimization scenarios involve multiple agents that
desire to protect the privacy of their preferences. There ex-
ist distributed algorithms for constraint optimization that pro-
vide improved privacy protection through secure multiparty
computation. However, it comes at the expense of high com-
putational complexity and does not constitute a rigorous pri-
vacy guarantee, as the result of the computation itself may
compromise agents’ preferences. In this work, we show how
to achieve differential privacy through randomization of the
solving process. In particular, we present P-Gibbs, which
adapts the SD-Gibbs algorithm to obtain differential privacy
guarantees with much higher computational efficiency. Ex-
periments on graph coloring and meeting scheduling show
the algorithm’s privacy-performance trade-off compared to
variants with uniform sampling and the SD-Gibbs algorithm.},
keywords = {differential privacy},
pubstate = {published},
tppubtype = {workshop}
}
Several optimization scenarios involve multiple agents that
desire to protect the privacy of their preferences. There ex-
ist distributed algorithms for constraint optimization that pro-
vide improved privacy protection through secure multiparty
computation. However, it comes at the expense of high com-
putational complexity and does not constitute a rigorous pri-
vacy guarantee, as the result of the computation itself may
compromise agents’ preferences. In this work, we show how
to achieve differential privacy through randomization of the
solving process. In particular, we present P-Gibbs, which
adapts the SD-Gibbs algorithm to obtain differential privacy
guarantees with much higher computational efficiency. Ex-
periments on graph coloring and meeting scheduling show
the algorithm’s privacy-performance trade-off compared to
variants with uniform sampling and the SD-Gibbs algorithm. |
| 4. | Dimitris Chatzopoulos; Anurag Jain; Sujit Gujar; Boi Faltings; Pan Hui: Towards Mobile Distributed Ledgers. In: IEEE Internet of Things Journal, 2021. (Type: Journal Article | BibTeX | Tags: )@article{chatzopoulos2021mobile,
title = {Towards Mobile Distributed Ledgers},
author = {Dimitris Chatzopoulos and Anurag Jain and Sujit Gujar and Boi Faltings and Pan Hui},
year = {2021},
date = {2021-01-01},
journal = {IEEE Internet of Things Journal},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
| 5. | Moin Hussain Moti; Dimitris Chatzopoulos; Pan Hui; Boi Faltings; Sujit Gujar: Orthos: A Trustworthy AI Framework For Data Acquisition. 8th International Workshop on Engineering Multi-Agent Systems (EMAS 2020), 2020. (Type: Workshop | BibTeX | Tags: Blockchains, Crowdsensing)@workshop{Moti2020,
title = {Orthos: A Trustworthy AI Framework For Data Acquisition},
author = {Moin Hussain Moti and Dimitris Chatzopoulos and Pan Hui and Boi Faltings and Sujit Gujar },
editor = {Moin Hussain Moti},
year = {2020},
date = {2020-05-11},
booktitle = {8th International Workshop on Engineering Multi-Agent Systems (EMAS 2020)},
keywords = {Blockchains, Crowdsensing},
pubstate = {published},
tppubtype = {workshop}
}
|
| 6. | Dimitris Chatzopoulos; Sujit Gujar; Boi Faltings; Pan Hui: Mneme: A Mobile Distributed Ledger. In: IEEE Conference on Communication, INFOCOM, IEEE, 2020. (Type: Conference | BibTeX | Tags: )@inproceedings{dimhatzo20a,
title = {Mneme: A Mobile Distributed Ledger},
author = {Dimitris Chatzopoulos and Sujit Gujar and Boi Faltings and Pan Hui},
year = {2020},
date = {2020-04-27},
booktitle = {IEEE Conference on Communication, INFOCOM},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| 7. | Sankarshan Damle; Boi Faltings; Sujit Gujar: A Truthful, Privacy-Preserving, Approximately Efficient Combinatorial Auction For Single-minded Bidders. In: AAMAS, pp. 1916–1918, International Foundation for Autonomous Agents and Multiagent Systems, 2019. (Type: Conference | BibTeX | Tags: auctions, Blockchains, Privacy, Security)@inproceedings{DBLP:conf/atal/DamleFG19,
title = {A Truthful, Privacy-Preserving, Approximately Efficient Combinatorial Auction For Single-minded Bidders},
author = {Sankarshan Damle and Boi Faltings and Sujit Gujar},
year = {2019},
date = {2019-01-01},
booktitle = {AAMAS},
pages = {1916--1918},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
keywords = {auctions, Blockchains, Privacy, Security},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| 8. | Dimitris Chatzopoulos; Sujit Gujar; Boi Faltings; Pan Hui: Privacy Preserving and Cost Optimal Mobile Crowdsensing Using Smart
Contracts on Blockchain. In: MASS, pp. 442–450, IEEE Computer Society, 2018. (Type: Conference | BibTeX | Tags: )@inproceedings{DBLP:conf/mass/ChatzopoulosGFH18,
title = {Privacy Preserving and Cost Optimal Mobile Crowdsensing Using Smart
Contracts on Blockchain},
author = {Dimitris Chatzopoulos and Sujit Gujar and Boi Faltings and Pan Hui},
year = {2018},
date = {2018-01-01},
booktitle = {MASS},
pages = {442--450},
publisher = {IEEE Computer Society},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| 9. | Sujit Gujar; Boi Faltings: Auction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing. In: Ceppi, Sofia; David, Esther; Hajaj, Chen; Robu, Valentin; Vetsikas, Ioannis A (Ed.): pp. 50–65, Springer International Publishing, Cham, 2017, ISBN: 978-3-319-54229-4, (Revised Selected Papers from AMEC/TADA 2015). (Type: Book Chapter | Abstract | BibTeX | Tags: )@inbook{10.1007/978-3-319-54229-4_4,
title = {Auction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing},
author = {Sujit Gujar and Boi Faltings},
editor = {Sofia Ceppi and Esther David and Chen Hajaj and Valentin Robu and Ioannis A Vetsikas},
isbn = {978-3-319-54229-4},
year = {2017},
date = {2017-01-01},
pages = {50--65},
publisher = {Springer International Publishing},
address = {Cham},
abstract = {Crowdsourcing marketplaces link large populations of workers to an even larger number of tasks. Thus, it is necessary to have mechanisms for matching workers with interesting and suitable tasks. Earlier work has addressed the problem of finding optimal workers for a given set of tasks. However, workers also have preferences and will stay with a platform only if it gives them interesting tasks. We therefore analyze several matching mechanisms that take into account workers' preferences as well. We propose that the workers pay premiums to get preferred matches and auction-based models where preferences are expressed through variations of the payment for a task. We analyze the properties of two matching different mechanisms: Split Dynamic VCG (SDV) and e-Auction. We compare both the mechanisms with Arrival Priority Serial Dictatorship (APSD) empirically for efficiency.},
note = {Revised Selected Papers from AMEC/TADA 2015},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
Crowdsourcing marketplaces link large populations of workers to an even larger number of tasks. Thus, it is necessary to have mechanisms for matching workers with interesting and suitable tasks. Earlier work has addressed the problem of finding optimal workers for a given set of tasks. However, workers also have preferences and will stay with a platform only if it gives them interesting tasks. We therefore analyze several matching mechanisms that take into account workers' preferences as well. We propose that the workers pay premiums to get preferred matches and auction-based models where preferences are expressed through variations of the payment for a task. We analyze the properties of two matching different mechanisms: Split Dynamic VCG (SDV) and e-Auction. We compare both the mechanisms with Arrival Priority Serial Dictatorship (APSD) empirically for efficiency. |
| 10. | Sujit Gujar; Boi Faltings: Auction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing. In: AMEC/TADA, pp. 50–65, Springer, 2016. (Type: Conference | BibTeX | Tags: )@inproceedings{DBLP:conf/amec/GujarF16,
title = {Auction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing},
author = {Sujit Gujar and Boi Faltings},
year = {2016},
date = {2016-01-01},
booktitle = {AMEC/TADA},
volume = {271},
pages = {50--65},
publisher = {Springer},
series = {Lecture Notes in Business Information Processing},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| 11. | Sujit Gujar; Boi Faltings: Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation. In: ECAI, pp. 1035–1043, IOS Press, 2016. (Type: Conference | BibTeX | Tags: )@inproceedings{DBLP:conf/ecai/GujarF16,
title = {Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation},
author = {Sujit Gujar and Boi Faltings},
year = {2016},
date = {2016-01-01},
booktitle = {ECAI},
volume = {285},
pages = {1035--1043},
publisher = {IOS Press},
series = {Frontiers in Artificial Intelligence and Applications},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| 12. | Dimitris Chatzopoulos; Sujit Gujar; Boi Faltings; Pan Hui: LocalCoin: An ad-hoc payment scheme for areas with high connectivity:
poster. In: MobiHoc, pp. 365–366, ACM, 2016. (Type: Conference | BibTeX | Tags: )@inproceedings{DBLP:conf/mobihoc/ChatzopoulosGFH16,
title = {LocalCoin: An ad-hoc payment scheme for areas with high connectivity:
poster},
author = {Dimitris Chatzopoulos and Sujit Gujar and Boi Faltings and Pan Hui},
year = {2016},
date = {2016-01-01},
booktitle = {MobiHoc},
pages = {365--366},
publisher = {ACM},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
