Georgios Amanatidis

SIAM J. Discret. Math., March, 2024

Algorithmically Fair Maximization of Multiple Submodular Objective Functions.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Fair division of indivisible goods: Recent progress and open questions.

[BibT_eX]

[DOI]

Georgios Papasotiropoulos

Xiaowei Wu

Artif. Intell., September, 2023

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes.

[BibT_eX]

[DOI]

CoRR, 2023

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.

[BibT_eX]

[DOI]

Guido Schäfer

Math. Oper. Res., 2022

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Fair Division of Indivisible Goods: A Survey.

[BibT_eX]

[DOI]

Xiaowei Wu

CoRR, 2022

Decentralised Update Selection with Semi-Strategic Experts.

[BibT_eX]

[DOI]

Francisco J. Marmolejo Cossío

Philip Lazos

CoRR, 2022

Decentralized Update Selection with Semi-strategic Experts.

[BibT_eX]

[DOI]

Francisco J. Marmolejo Cossío

Philip Lazos

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Fair Division of Indivisible Goods: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Inequity aversion pricing over social networks: Approximation algorithms and hardness results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Maximum Nash welfare and other stories about EFX.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Peeking behind the ordinal curtain: Improving distortion via cardinal queries.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination.

[BibT_eX]

[DOI]

Apostolos Ntokos

Theor. Comput. Sci., 2020

Rapid mixing of the switch Markov chain for strongly stable degree sequences.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Connected realizations of joint-degree matrices.

[BibT_eX]

[DOI]

Christos-Alexandros Psomas

Bradley Green

Milena Mihail

Discret. Appl. Math., 2018

An Improved Envy-Free Cake Cutting Protocol for Four Agents.

[BibT_eX]

[DOI]

Eftychia Vakaliou

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Comparing Approximate Relaxations of Envy-Freeness.

[BibT_eX]

[DOI]

Vangelis Markakis

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Algorithmic and mechanism design aspects of problems with limited or non-payments

[BibT_eX]

[DOI]

PhD thesis, 2017

Approximation Algorithms for Computing Maximin Share Allocations.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results.

[BibT_eX]

[DOI]

Krzysztof Sornat

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On Truthful Mechanisms for Maximin Share Allocations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Graphic Realizations of Joint-Degree Matrices.

[BibT_eX]

[DOI]

Bradley Green

Milena Mihail

CoRR, 2015

Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2007

Provably-Secure Schemes for Basic Query Support in Outsourced Databases.

[BibT_eX]

[DOI]