On the public citation graph

Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity

0 signed · 170 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16761-7_93openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-72200-7_3openalex-snapshot
The First Answer Set Programming System Competition
inferredcites →https://doi.org/10.1007/s003550100119openalex-snapshot
A simple procedure for finding equitable allocations of indivisible goods
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferredcites →https://doi.org/10.1016/j.artint.2005.01.006openalex-snapshot
The complexity of contract negotiation
inferredcites →https://doi.org/10.1016/j.jet.2004.05.005openalex-snapshot
Collective choice under dichotomous preferences
inferredcites →https://doi.org/10.1016/j.mcm.2008.05.013openalex-snapshot
Mathematics and democracy: Designing better voting and fair-division procedures
inferredcites →https://doi.org/10.1017/cbo9780511543357openalex-snapshot
Knowledge Representation, Reasoning and Declarative Problem Solving
inferredcites →https://doi.org/10.1023/b:amai.0000034522.25580.09openalex-snapshot
Logical Preference Representation and Combinatorial Vote
inferredcites →https://doi.org/10.1023/b:theo.0000024421.85722.0aopenalex-snapshot
FAIR DIVISION OF INDIVISIBLE ITEMS
inferredcites →https://doi.org/10.1093/logcom/2.3.397openalex-snapshot
Complexity Results for Nonmonotonic Logics
inferredcites →https://doi.org/10.1137/0219058openalex-snapshot
Bounded Query Classes
inferredcites →https://doi.org/10.1145/1064009.1064030openalex-snapshot
Marginal contribution nets
inferredcites →https://doi.org/10.1145/1082473.1082747openalex-snapshot
Allocation of indivisible goods
inferredcites →https://doi.org/10.1145/1250790.1250808openalex-snapshot
An approximation algorithm for max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1177/1043463105058317openalex-snapshot
Efficient Fair Division
inferredcites →https://doi.org/10.1287/mnsc.44.8.1131openalex-snapshot
Computationally Manageable Combinational Auctions
inferredcites →https://doi.org/10.1613/jair.1870openalex-snapshot
Negotiating Socially Optimal Allocations of Resources
inferredcites →https://doi.org/10.2307/1061013openalex-snapshot
Equity: In Theory and Practice
inferredcites →https://doi.org/10.2307/2589237openalex-snapshot
Fair Division: From Cake-Cutting to Dispute Resolution.
inferredcites →https://doi.org/10.2307/2589459openalex-snapshot
Cake-Cutting Algorithms: Be Fair if You Can.
inferredcites →https://doi.org/10.4230/dagsemproc.07261.6openalex-snapshot
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure
inferredcites →https://doi.org/10.7551/mitpress/8637.003.0011openalex-snapshot
Combinatorial Auctions
inferredcites →https://doi.org/10.7551/mitpress/9780262033428.003.0010openalex-snapshot
Bidding Languages for Combinatorial Auctions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4890743openalex-extracted
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items Under a Common Preference Graph
inferred← citeshttps://doi.org/10.1007/11518655_3openalex-snapshot
Some Representation and Computational Issues in Social Choice
inferred← citeshttps://doi.org/10.1007/11559221_41openalex-snapshot
Multiagent Resource Allocation in the Presence of Externalities
inferred← citeshttps://doi.org/10.1007/978-1-0716-0368-0_198openalex-snapshot
Fair Division
inferred← citeshttps://doi.org/10.1007/978-3-030-00111-7_6openalex-snapshot
Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items
inferred← citeshttps://doi.org/10.1007/978-3-030-06164-7_18openalex-snapshot
Collective Decision Making
inferred← citeshttps://doi.org/10.1007/978-3-030-06164-7_7openalex-snapshot
Compact Representation of Preferences
inferred← citeshttps://doi.org/10.1007/978-3-030-30244-3_49openalex-snapshot
Fair Division Minimizing Inequality
inferred← citeshttps://doi.org/10.1007/978-3-030-30473-7_25openalex-snapshot
Fair Division with Subsidy
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_3openalex-snapshot
Finding Fair and Efficient Allocations When Valuations Don’t Add Up
inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3_16openalex-snapshot
Approximate Competitive Equilibrium with Generic Budget
inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_21openalex-snapshot
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_25openalex-snapshot
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences
inferred← citeshttps://doi.org/10.1007/978-3-031-20865-2_29openalex-snapshot
EEF1-NN: Efficient and EF1 Allocations Through Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-11206-0_2openalex-snapshot
Allocation in Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-23114-3_22openalex-snapshot
Verification in Argument-Incomplete Argumentation Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-319-59294-7_37openalex-snapshot
Coalition Formation with Logic-Based Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_4openalex-snapshot
A Short Introduction to Computational Social Choice
inferred← citeshttps://doi.org/10.1007/978-3-642-00487-2_40openalex-snapshot
A Realistic Approach to Solve the Nash Welfare
inferred← citeshttps://doi.org/10.1007/978-3-642-02562-4_12openalex-snapshot
A Multi-Agent Resource Negotiation for the Utilitarian Welfare
inferred← citeshttps://doi.org/10.1007/978-3-642-04428-1_10openalex-snapshot
On Low-Envy Truthful Allocations
inferred← citeshttps://doi.org/10.1007/978-3-642-04428-1_9openalex-snapshot
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_27openalex-snapshot
The Complexity of Computing Minimal Unidirectional Covering Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-15117-0_9openalex-snapshot
Nash Social Welfare in Multiagent Resource Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_11openalex-snapshot
dl2asp: Implementing Default Logic via Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-16567-2_11openalex-snapshot
Bicriteria Models for Fair and Efficient Resource Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_198-2openalex-snapshot
Fair Division
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_198-3openalex-snapshot
Fair Division
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_7openalex-snapshot
On Envy-Free Pareto Efficient Pricing
inferred← citeshttps://doi.org/10.1007/978-3-642-41575-3_21openalex-snapshot
How to Decrease the Degree of Envy in Allocations of Indivisible Goods
inferred← citeshttps://doi.org/10.1007/s00224-011-9359-yopenalex-snapshot
The Efficiency of Fair Division
inferred← citeshttps://doi.org/10.1007/s00224-012-9437-9openalex-snapshot
The Complexity of Computing Minimal Unidirectional Covering Sets
inferred← citeshttps://doi.org/10.1007/s00224-024-10210-xopenalex-snapshot
One-Sided Markets with Externalities
inferred← citeshttps://doi.org/10.1007/s00355-012-0684-0openalex-snapshot
Fair allocation of indivisible goods: the two-agent case
inferred← citeshttps://doi.org/10.1007/s00355-018-1157-xopenalex-snapshot
Dividing bads under additive utilities
inferred← citeshttps://doi.org/10.1007/s00453-018-0434-5openalex-snapshot
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases
inferred← citeshttps://doi.org/10.1007/s10458-011-9188-zopenalex-snapshot
Fair solutions for some multiagent optimization problems
inferred← citeshttps://doi.org/10.1007/s10458-018-9393-0openalex-snapshot
Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods
inferred← citeshttps://doi.org/10.1007/s10458-021-09532-8openalex-snapshot
Fair allocation of indivisible goods and chores
inferred← citeshttps://doi.org/10.1007/s10479-008-0335-0openalex-snapshot
Multiagent resource allocation in k-additive domains: preference representation and complexity
inferred← citeshttps://doi.org/10.1007/s10479-017-2710-1openalex-snapshot
Handling preferences in student-project allocation
inferred← citeshttps://doi.org/10.1007/s10726-016-9502-xopenalex-snapshot
Maximin Envy-Free Division of Indivisible Items
inferred← citeshttps://doi.org/10.1007/s11238-025-10098-0openalex-snapshot
Jérôme Lang’s contributions at the interface of economic theory with artificial intelligence
inferred← citeshttps://doi.org/10.1016/j.apenergy.2019.113325openalex-snapshot
Welfare-aware strategic demand control in an intelligent market-based framework: Move towards sustainable smart grid
inferred← citeshttps://doi.org/10.1016/j.artint.2010.07.003openalex-snapshot
Compactly representing utility functions using weighted goals and the max aggregator
inferred← citeshttps://doi.org/10.1016/j.artint.2011.03.004openalex-snapshot
Preferences in AI: An overview
inferred← citeshttps://doi.org/10.1016/j.artint.2012.09.006openalex-snapshot
Computing desirable partitions in additively separable hedonic games
inferred← citeshttps://doi.org/10.1016/j.artint.2015.06.002openalex-snapshot
Fair assignment of indivisible objects under ordinal preferences
inferred← citeshttps://doi.org/10.1016/j.artint.2016.09.005openalex-snapshot
Distributed fair allocation of indivisible goods
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.001openalex-snapshot
Computing a small agreeable set of indivisible items
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103664openalex-snapshot
Envy-Free Allocations Respecting Social Networks
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103820openalex-snapshot
Fair and efficient allocation with few agent types, few item types, or small value levels
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103826openalex-snapshot
Parameterized complexity of envy-free resource allocation in social networks
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103965openalex-snapshot
Fair division of indivisible goods: Recent progress and open questions
inferred← citeshttps://doi.org/10.1016/j.artint.2023.104049openalex-snapshot
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
inferred← citeshttps://doi.org/10.1016/j.artmed.2020.101980openalex-snapshot
A stochastic multi-agent approach for medical-image segmentation: Application to tumor segmentation in brain MR images
inferred← citeshttps://doi.org/10.1016/j.cor.2010.03.001openalex-snapshot
A general branch-and-bound algorithm for fair division problems
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.010openalex-snapshot
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100913openalex-snapshot
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.10.013openalex-snapshot
Computing welfare-Maximizing fair allocations of indivisible goods
inferred← citeshttps://doi.org/10.1016/j.geb.2023.09.001openalex-snapshot
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.10.017openalex-snapshot
Modelling incomplete information in Boolean games using possibilistic logic
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2019.11.003openalex-snapshot
Multi-unit assignment under dichotomous preferences
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.029openalex-snapshot
Worst case compromises in matroids with applications to the allocation of indivisible goods
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.011openalex-snapshot
Efficient reallocation under additive and responsive preferences
inferred← citeshttps://doi.org/10.1017/s0269888905000470openalex-snapshot
Multiagent resource allocation
inferred← citeshttps://doi.org/10.1109/acait53529.2021.9731163openalex-snapshot
Minimal-envy Conference Paper Assignment: Formulation and a Fast Iterative Algorithm
inferred← citeshttps://doi.org/10.1109/his.2011.6122187openalex-snapshot
A GRATIS theorem for relational optimization
inferred← citeshttps://doi.org/10.1109/iccic.2012.6510221openalex-snapshot
Multi Agent Resource Allocation — Serial dictatorship with ties
inferred← citeshttps://doi.org/10.1109/ictest64710.2025.11042849openalex-snapshot
Advanced Resource Allocation Techniques for Efficient Cloud Computing
inferred← citeshttps://doi.org/10.1109/incos.2011.23openalex-snapshot
A Generic Approach to Multi-fairness and Its Application to Wireless Channel Allocation
inferred← citeshttps://doi.org/10.1109/tnet.2022.3213426openalex-snapshot
Fair Multi-Resource Allocation in Heterogeneous Servers With an External Resource Type
inferred← citeshttps://doi.org/10.1109/wi-iat.2013.90openalex-snapshot
Distributed Local Search for Minimizing Envy
inferred← citeshttps://doi.org/10.1137/1.9781611975031.165openalex-snapshot
Almost Envy-Freeness with General Valuations
inferred← citeshttps://doi.org/10.1137/19m1244305openalex-snapshot
Communication Complexity of Discrete Fair Division
inferred← citeshttps://doi.org/10.1145/1082473.1082747openalex-snapshot
Allocation of indivisible goods
inferred← citeshttps://doi.org/10.1145/1666420.1666442openalex-snapshot
Making decisions based on the preferences of multiple agents
inferred← citeshttps://doi.org/10.1145/2508028.2505987openalex-snapshot
Decomposing combinatorial auctions and set packing problems
inferred← citeshttps://doi.org/10.1145/2940716.2940726openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferred← citeshttps://doi.org/10.1145/3033274.3085125openalex-snapshot
Fair Public Decision Making
inferred← citeshttps://doi.org/10.1145/3485006openalex-snapshot
Finding Fair and Efficient Allocations for Matroid Rank Valuations
inferred← citeshttps://doi.org/10.1146/annurev-economics-080218-025559openalex-snapshot
Fair Division in the Internet Age
inferred← citeshttps://doi.org/10.1177/1059712311421831openalex-snapshot
A simple metric for turn-taking in emergent communication
inferred← citeshttps://doi.org/10.15496/publikation-26302openalex-snapshot
Having a Hard Time? Explore Parameterized Complexity!
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8815openalex-snapshot
Envy-Free Division of Sellable Goods
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8825openalex-snapshot
On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8884openalex-snapshot
The Computational Rise and Fall of Fairness
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9774openalex-snapshot
Challenges in Resource and Cost Allocation
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10041openalex-snapshot
When Can the Maximin Share Guarantee Be Guaranteed?
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10046openalex-snapshot
Graphical Hedonic Games of Bounded Treewidth
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012045openalex-snapshot
Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017741openalex-snapshot
Active Preference Learning Based on Generalized Gini Functions: Application to the Multiagent Knapsack Problem
inferred← citeshttps://doi.org/10.1609/aaai.v34i05.6201openalex-snapshot
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16647openalex-snapshot
Fair and Truthful Mechanisms for Dichotomous Valuations
inferred← citeshttps://doi.org/10.1609/aaai.v36i11.21486openalex-snapshot
Local Justice and the Algorithmic Allocation of Scarce Societal Resources
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20416openalex-snapshot
On Improving Resource Allocations by Sharing
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28822openalex-snapshot
The Complexity of Fair Division of Indivisible Items with Externalities
inferred← citeshttps://doi.org/10.1609/aimag.v29i4.2201openalex-snapshot
Preference Handling in Combinatorial Domains: From AI to Social Choice
inferred← citeshttps://doi.org/10.1613/jair.1.11582openalex-snapshot
Weighted Matching Markets with Budget Constraints
inferred← citeshttps://doi.org/10.1613/jair.1.11994openalex-snapshot
Fair Allocation with Diminishing Differences
inferred← citeshttps://doi.org/10.1613/jair.1.13704openalex-snapshot
Pricing Problems with Buyer Preselection
inferred← citeshttps://doi.org/10.1613/jair.1.15001openalex-snapshot
Improving Resource Allocations by Sharing in Pairs
inferred← citeshttps://doi.org/10.1613/jair.1870openalex-snapshot
Negotiating Socially Optimal Allocations of Resources
inferred← citeshttps://doi.org/10.1613/jair.4224openalex-snapshot
Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings
inferred← citeshttps://doi.org/10.2139/ssrn.2826474openalex-snapshot
Dividing Goods or Bads Under Additive Utilities
inferred← citeshttps://doi.org/10.2139/ssrn.2914241openalex-snapshot
Competitive Division of a Mixed Manna
inferred← citeshttps://doi.org/10.2139/ssrn.2944096openalex-snapshot
Multi-Unit Assignment under Dichotomous Preferences
inferred← citeshttps://doi.org/10.2139/ssrn.3309074openalex-snapshot
Multi-Unit Assignment Under Dichotomous Preferences
inferred← citeshttps://doi.org/10.2139/ssrn.4581019openalex-snapshot
Descriptive Complexity of Some Fair Division Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2017/174openalex-snapshot
Fair Allocation based on Diminishing Differences
inferred← citeshttps://doi.org/10.24963/ijcai.2019/40openalex-snapshot
Equitable Allocations of Indivisible Goods
inferred← citeshttps://doi.org/10.24963/ijcai.2019/70openalex-snapshot
Graphical One-Sided Markets
inferred← citeshttps://doi.org/10.24963/ijcai.2020/691openalex-snapshot
Fair Division: The Computer Scientist’s Perspective
inferred← citeshttps://doi.org/10.24963/ijcai.2021/20openalex-snapshot
The Parameterized Complexity of Connected Fair Division
inferred← citeshttps://doi.org/10.24963/ijcai.2021/6openalex-snapshot
Combining Fairness and Optimality when Selecting and Allocating Projects
inferred← citeshttps://doi.org/10.24963/ijcai.2022/9openalex-snapshot
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations
inferred← citeshttps://doi.org/10.25561/95470openalex-snapshot
Negotiating socially optimal allocations of resources: an overview
inferred← citeshttps://doi.org/10.26021/3096openalex-snapshot
Measuring and Influencing Sequential Joint Agent Behaviours
inferred← citeshttps://doi.org/10.3166/ria.23.651-672openalex-snapshot
La maximisation du bien-être utilitaire des sociétés d'agents
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-387openalex-snapshot
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-360openalex-snapshot
Approximate Tradeoffs on Matroids
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-1039openalex-snapshot
From Default and Autoepistemic Logics to Disjunctive Answer Set Programs via the Logic of GK
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-141openalex-snapshot
Manipulating picking sequences
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-393openalex-snapshot
Near Fairness in Matroids
inferred← citeshttps://doi.org/10.3233/aic-180770openalex-snapshot
Coalition formation in social environments with logic-based agents1
inferred← citeshttps://doi.org/10.3233/faia230284openalex-snapshot
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
inferred← citeshttps://doi.org/10.32657/10356/50746openalex-snapshot
On the tradeoff among efficiency, fairness and revenue in resource allocation
inferred← citeshttps://doi.org/10.4204/eptcs.379.22openalex-snapshot
Maximizing Social Welfare in Score-Based Social Distance Games
inferred← citeshttps://doi.org/10.48550/arxiv.0810.0532openalex-snapshot
Three New Complexity Results for Resource Allocation Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0809openalex-snapshot
Implementing Default and Autoepistemic Logics via the Logic of GK
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3130openalex-snapshot
Allocation in Practice
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2226openalex-snapshot
Possible and Necessary Allocations via Sequential Mechanisms
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07062openalex-snapshot
Boolean Hedonic Games
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04234openalex-snapshot
Lecture Notes on Fair Division
inferred← citeshttps://doi.org/10.48550/arxiv.1911.06757openalex-snapshot
Graphical One-Sided Markets
inferred← citeshttps://doi.org/10.48550/arxiv.2104.12828openalex-snapshot
Multi-resource allocation for federated settings: A non-homogeneous Markov chain model
inferred← citeshttps://doi.org/10.5555/2615731.2615792openalex-snapshot
Efficiency and fairness in team search with self-interested agents
inferred← citeshttps://doi.org/10.5555/2615731.2617456openalex-snapshot
Fair assignment of indivisible objects under ordinal preferences
inferred← citeshttps://doi.org/10.5555/3091125.3091169openalex-snapshot
Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods
inferred← citeshttps://doi.org/10.5555/3091125.3091176openalex-snapshot
Weighted Matching Markets with Budget Constraints
inferred← citeshttps://doi.org/10.65109/auxi8882openalex-snapshot
Fair assignment of indivisible objects under ordinal preferences
inferred← citeshttps://doi.org/10.65109/lyep9074openalex-snapshot
Optimal Reallocation under Additive and Ordinal Preferences
inferred← citeshttps://doi.org/10.70675/beff5468zb662z42d8zb96fzff5b43ebf57dopenalex-snapshot
Interaction among agents via a social network in computational social choice
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.