default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhuva Mu'alem
Person information
- affiliation: Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Ahuva Mu'alem
, Juan Carlos Carbajal:
Mind the Revenue Gap: On the Performance of Approximation Mechanisms Under Budget Constraints. SAGT 2024: 279-296- 2020
- [j8]Juan Carlos Carbajal, Ahuva Mu'alem:
Selling mechanisms for a financially constrained buyer. Games Econ. Behav. 124: 386-405 (2020)
2010 – 2019
- 2018
- [j7]Ahuva Mu'alem, Michael Schapira:
Setting lower bounds on truthfulness. Games Econ. Behav. 110: 174-193 (2018) - 2015
- [i3]Ahuva Mu'alem, Michael Schapira:
Setting Lower Bounds on Truthfulness. CoRR abs/1507.08708 (2015) - 2014
- [j6]Ahuva Mu'alem:
Fair by design: Multidimensional envy-free mechanisms. Games Econ. Behav. 88: 29-46 (2014) - [c13]Orna Agmon Ben-Yehuda, Eyal Posener, Muli Ben-Yehuda, Assaf Schuster, Ahuva Mu'alem:
Ginseng: market-driven memory allocation. VEE 2014: 41-52 - [i2]Ahuva Mu'alem:
Monotonicity, Revenue Equivalence and Budgets. CoRR abs/1404.7784 (2014) - 2010
- [c12]Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'alem:
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets. CCGRID 2010: 205-214
2000 – 2009
- 2009
- [j5]Ron Lavi, Ahuva Mu'alem, Noam Nisan:
Two simplified proofs for Roberts' theorem. Soc. Choice Welf. 32(3): 407-423 (2009) - [c11]Ahuva Mu'alem:
On Multi-dimensional Envy-Free Mechanisms. ADT 2009: 120-131 - [c10]David Kempe, Ahuva Mu'alem, Mahyar Salek:
Envy-Free Allocations for Budgeted Bidders. WINE 2009: 537-544 - 2008
- [j4]Ahuva Mu'alem, Noam Nisan:
Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ. Behav. 64(2): 612-631 (2008) - [j3]Ahuva Mu'alem, Michael Schapira:
Characterizing truthfulness in discrete domains. SIGecom Exch. 7(2) (2008) - [c9]Lior Amar, Ahuva Mu'alem, Jochen Stößer:
On the importance of migration for fairness in online grid markets. AAMAS (3) 2008: 1299-1302 - [c8]Lior Amar, Ahuva Mu'alem, Jochen Stößer:
The Power of Preemption in Economic Online Markets. GECON 2008: 41-57 - [c7]Lior Amar, Ahuva Mu'alem, Jochen Stößer:
On the importance of migration for fairness in online grid markets. GRID 2008: 65-74 - [c6]Ahuva Mu'alem, Michael Schapira:
Mechanism design over discrete domains. EC 2008: 31-37 - 2007
- [c5]Ahuva Mu'alem, Michael Schapira:
Setting lower bounds on truthfulness: extended abstract. SODA 2007: 1143-1152 - 2006
- [b1]Ahuva Mu'alem:
Incentives and computation : combinatorial auctions and networks (תמריצים וחישוב.). Hebrew University of Jerusalem, Israel, 2006 - 2005
- [j2]Dror G. Feitelson, Ahuva Mu'alem:
On the definition of "on-line" in job scheduling problems. SIGACT News 36(1): 122-131 (2005) - [c4]Ahuva Mu'alem:
On decentralized incentive compatible mechanisms. EC 2005: 240-248 - [i1]Ahuva Mu'alem:
A Note on Testing Truthfulness. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [c3]Ron Lavi, Ahuva Mu'alem, Noam Nisan:
Towards a Characterization of Truthful Combinatorial Auctions. FOCS 2003: 574-583 - 2002
- [c2]Ahuva Mu'alem, Noam Nisan:
Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. AAAI/IAAI 2002: 379-384 - 2001
- [j1]Ahuva Mu'alem Weil, Dror G. Feitelson:
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Trans. Parallel Distributed Syst. 12(6): 529-543 (2001)
1990 – 1999
- 1998
- [c1]Dror G. Feitelson, Ahuva Mu'alem Weil:
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. IPPS/SPDP 1998: 542-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
