default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2021
- Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. ACM Trans. Economics and Comput. 9(3): 17:1-17:18 (2021) - Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. ACM Trans. Economics and Comput. 9(2): 9:1-9:24 (2021) - Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations for Matroid Rank Valuations. ACM Trans. Economics and Comput. 9(4): 21:1-21:41 (2021) - Vittorio Bilò, Marios Mavronicolas:
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. ACM Trans. Economics and Comput. 9(3): 14:1-14:25 (2021) - Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-freeness in Indivisible Item Allocation. ACM Trans. Economics and Comput. 9(3): 18:1-18:39 (2021) - Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Trans. Economics and Comput. 9(4): 20:1-20:55 (2021) - Yu Cheng, Nick Gravin, Kamesh Munagala, Kangning Wang:
A Simple Mechanism for a Budget-Constrained Buyer. ACM Trans. Economics and Comput. 9(2): 10:1-10:25 (2021) - Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 1. ACM Trans. Economics and Comput. 9(1): 1:1 (2021) - Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 2. ACM Trans. Economics and Comput. 9(2): 8:1 (2021) - Ágnes Cseh, Attila Juhos:
Pairwise Preferences in the Stable Marriage Problem. ACM Trans. Economics and Comput. 9(1): 7:1-7:28 (2021) - John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. 9(3): 13:1-13:17 (2021) - Khaled M. Elbassioni:
A QPTAS for ɛ-Envy-Free Profit-Maximizing Pricing on Line Graphs. ACM Trans. Economics and Comput. 9(3): 16:1-16:31 (2021) - Anat Ganor, Karthik C. S., Dömötör Pálvölgyi:
On Communication Complexity of Fixed Point Computation. ACM Trans. Economics and Comput. 9(4): 25:1-25:27 (2021) - Yiannis Giannakopoulos, Diogo Poças, Keyu Zhu:
Optimal Pricing for MHR and λ-regular Distributions. ACM Trans. Economics and Comput. 9(1): 2:1-2:28 (2021) - Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries. ACM Trans. Economics and Comput. 9(1): 3:1-3:36 (2021) - Paul Gölz, Anson Kahng, Simon Mackenzie, Ariel D. Procaccia:
The Fluid Mechanics of Liquid Democracy. ACM Trans. Economics and Comput. 9(4): 23:1-23:39 (2021) - Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Games of Imperfect Recall. ACM Trans. Economics and Comput. 9(4): 22:1-22:26 (2021) - Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. ACM Trans. Economics and Comput. 9(1): 5:1-5:34 (2021) - Pooya Jalaly, Éva Tardos:
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. ACM Trans. Economics and Comput. 9(1): 4:1-4:20 (2021) - Aadharsh Kannan, Jacob LaRiviere, R. Preston McAfee:
Characterizing the Usage Intensity of Public Cloud. ACM Trans. Economics and Comput. 9(3): 15:1-15:18 (2021) - Andrew Kephart, Vincent Conitzer:
The Revelation Principle for Mechanism Design with Signaling Costs. ACM Trans. Economics and Comput. 9(1): 6:1-6:35 (2021) - Zhentao Li, Adrian Vetta:
The Fair Division of Hereditary Set Systems. ACM Trans. Economics and Comput. 9(2): 12:1-12:19 (2021) - Simon Mauras:
Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures. ACM Trans. Economics and Comput. 9(4): 24:1-24:14 (2021) - Dario Paccagnan, Rahul Chandan, Bryce L. Ferguson, Jason R. Marden:
Optimal Taxes in Atomic Congestion Games. ACM Trans. Economics and Comput. 9(3): 19:1-19:33 (2021)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-30 03:24 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint