Ranking with fairness constraints

LE Celis, D Straszak, NK Vishnoi - arXiv preprint arXiv:1704.06840, 2017 - arxiv.org
Ranking algorithms are deployed widely to order a set of items in applications such as
search engines, news feeds, and recommendation systems. Recent studies, however, have …

Truthful mechanism for joint resource allocation and task offloading in mobile edge computing

X Liu, J Liu, W Li - Computer Networks, 2024 - Elsevier
In the context of mobile edge computing (MEC), the delay-sensitive tasks can achieve real-
time data processing and analysis by offloading to the MEC servers. The objective is …

A truthful double auction mechanism for multi-resource allocation in crowd sensing systems

X Liu, J Liu - IEEE Transactions on Services Computing, 2021 - ieeexplore.ieee.org
As a novel sensing paradigm, crowd sensing systems have gained great attention and been
widely adopted in the environmental monitoring and calculation areas. In crowd sensing …

D-SPAC: Double-Sided Preference-Aware Carpooling of Private Cars for Maximizing Passenger Utility

L Chen, HN Dai, X Yuan, J Huang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Private car-based carpooling (PCC) has become an important transportation mode in our
daily life. Unlike ride-hailing or taxi-based carpooling, PCC has two unique features that …

[PDF][PDF] Buying cheap is expensive: Hardness of non-parametric multi-product pricing

P Briest, P Krysta - SODA, 2007 - Citeseer
We investigate non-parametric unit-demand pricing problems, in which the goal is to find
revenue maximizing prices for products P based on a set of consumer profiles C obtained …

Combinatorial auctions without money

D Fotakis, P Krysta, C Ventre - Algorithmica, 2017 - Springer
Abstract Algorithmic Mechanism Design attempts to marry computation and incentives,
mainly by leveraging monetary transfers between designer and selfish agents involved. This …

Iterative packing for demand and hypergraph matching

O Parekh - International Conference on Integer Programming and …, 2011 - Springer
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions
regarding the approximability of problems dominated by covering constraints. Although …

Generalized hypergraph matching via iterated packing and local ratio

O Parekh, D Pritchard - International Workshop on Approximation and …, 2014 - Springer
In k k-hypergraph matching, we are given a collection of sets of size at most kk, each with an
associated weight, and we seek a maximum-weight subcollection whose sets are pairwise …

Engineering Hypergraph -Matching Algorithms

E Großmann, F Joos, H Reinstädtler… - arXiv preprint arXiv …, 2024 - arxiv.org
Recently, researchers have extended the concept of matchings to the more general problem
of finding $ b $-matchings in hypergraphs broadening the scope of potential applications …

[HTML][HTML] Combinatorial auctions with verification are tractable

P Krysta, C Ventre - Theoretical Computer Science, 2015 - Elsevier
We study mechanism design for social welfare maximization in combinatorial auctions with
general bidders given by demand oracles. It is a major open problem in this setting to design …