Ahuva Mu'alem

Orcid: 0009-0002-7261-9876

Affiliations:
  • Hebrew University of Jerusalem, Israel


According to our database1, Ahuva Mu'alem authored at least 23 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mind the Revenue Gap: On the Performance of Approximation Mechanisms Under Budget Constraints.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2020
Selling mechanisms for a financially constrained buyer.
Games Econ. Behav., 2020

2018
Setting lower bounds on truthfulness.
Games Econ. Behav., 2018

2014
Fair by design: Multidimensional envy-free mechanisms.
Games Econ. Behav., 2014

Monotonicity, Revenue Equivalence and Budgets.
CoRR, 2014

Ginseng: market-driven memory allocation.
Proceedings of the 10th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, 2014

2010
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets.
Proceedings of the 10th IEEE/ACM International Conference on Cluster, 2010

2009
Two simplified proofs for Roberts' theorem.
Soc. Choice Welf., 2009

Envy-Free Allocations for Budgeted Bidders.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Multi-dimensional Envy-Free Mechanisms.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Characterizing truthfulness in discrete domains.
SIGecom Exch., 2008

Truthful approximation mechanisms for restricted combinatorial auctions.
Games Econ. Behav., 2008

Mechanism design over discrete domains.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

On the importance of migration for fairness in online grid markets.
Proceedings of the 9th IEEE/ACM International Conference on Grid Computing (Grid 2008), Tsukuba, Japan, September 29, 2008

The Power of Preemption in Economic Online Markets.
Proceedings of the Grid Economics and Business Models, 5th International Workshop, 2008

2007
Setting lower bounds on truthfulness: extended abstract.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Incentives and computation : combinatorial auctions and networks (תמריצים וחישוב.).
PhD thesis, 2006

2005
On the definition of "on-line" in job scheduling problems.
SIGACT News, 2005

A Note on Testing Truthfulness
Electron. Colloquium Comput. Complex., 2005

On decentralized incentive compatible mechanisms.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2003
Towards a Characterization of Truthful Combinatorial Auctions.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2001
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling.
IEEE Trans. Parallel Distributed Syst., 2001

1998
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998


  Loading...