


Остановите войну!
for scientists:


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 225 matches
- 2023
- Mete Seref Ahunbay
, Adrian Vetta
:
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions. ACM Trans. Economics and Comput. 11: 2:1-2:26 (2023) - Felix Brandt
, Martin Bullinger
, Anaëlle Wilczynski
:
Reaching Individually Stable Coalition Structures. ACM Trans. Economics and Comput. 11: 4:1-4:65 (2023) - Tushant Jha
, Yair Zick
:
A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts. ACM Trans. Economics and Comput. 11: 5:1-5:23 (2023) - Jochen Könemann
, Justin Toth:
A Framework for Computing the Nucleolus via Dynamic Programming. ACM Trans. Economics and Comput. 11: 3:1-3:21 (2023) - Stefanos Leonardos
, Joseph Sakos
, Costas Courcoubetis
, Georgios Piliouras
:
Catastrophe by Design in Population Games: A Mechanism to Destabilize Inefficient Locked-in Technologies. ACM Trans. Economics and Comput. 11: 1:1-1:36 (2023) - 2022
- Georgios Birmpas
, Evangelos Markakis
, Guido Schäfer
:
Cost Sharing over Combinatorial Domains. ACM Trans. Economics and Comput. 10(1): 4:1-4:26 (2022) - Niclas Boehmer
, Klaus Heeger
:
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas. ACM Trans. Economics and Comput. 10(2): 9:1-9:53 (2022) - Christine T. Cheng
, Will Rosenbaum
:
Stable Matchings with Restricted Preferences: Structure and Complexity. ACM Trans. Economics and Comput. 10(3): 13:1-13:45 (2022) - Jakub Dargaj
, Jakob Grue Simonsen
:
Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria. ACM Trans. Economics and Comput. 10(1): 3:1-3:39 (2022) - Yiannis Giannakopoulos
, Diogo Poças
, Alexandros Tsigonias-Dimitriadis
:
Robust Revenue Maximization Under Minimal Statistical Information. ACM Trans. Economics and Comput. 10(3): 11:1-11:34 (2022) - Nathanaël Gross-Humbert
, Nawal Benabbou
, Aurélie Beynier
, Nicolas Maudet
:
Sequential and Swap Mechanisms for Public Housing Allocation with Quotas and Neighbourhood-based Utilities. ACM Trans. Economics and Comput. 10(4): 15:1-15:24 (2022) - Martin Hoefer
, Xujin Chen
, Nikolai Gravin
, Ruta Mehta
:
Introduction to the Special Issue on WINE'20: Part 1. ACM Trans. Economics and Comput. 10(2): 6:1 (2022) - Ron Lavi
, Or Sattath
, Aviv Zohar
:
Redesigning Bitcoin's Fee Market. ACM Trans. Economics and Comput. 10(1): 5:1-5:31 (2022) - Yang Liu
, Juntao Wang
, Yiling Chen
:
Surrogate Scoring Rules. ACM Trans. Economics and Comput. 10(3): 12:1-12:36 (2022) - Edwin Lock
, Paul W. Goldberg
, Francisco J. Marmolejo Cossío
:
Learning Strong Substitutes Demand via Queries. ACM Trans. Economics and Comput. 10(2): 10:1-10:22 (2022) - Will Ma
:
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. ACM Trans. Economics and Comput. 10(2): 7:1-7:32 (2022) - Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization among Offline Agents in Online-Matching Markets. ACM Trans. Economics and Comput. 10(4): 16:1-16:27 (2022) - Barnabé Monnot
, Francisco Benita
, Georgios Piliouras
:
Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division. ACM Trans. Economics and Comput. 10(1): 2:1-2:26 (2022) - Robert Scheffler
, Martin Strehler
, Laura Vargas Koch
:
Routing Games with Edge Priorities. ACM Trans. Economics and Comput. 10(1): 1:1-1:27 (2022) - Grant Schoenebeck
, Fang-Yi Yu
:
Two Strongly Truthful Mechanisms for Three Heterogeneous Agents Answering One Question. ACM Trans. Economics and Comput. 10(4): 14:1-14:26 (2022) - Cosimo Vinci
, Vittorio Bilò
, Gianpiero Monaco
, Luca Moscardelli
:
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10(2): 8:1-8:41 (2022) - 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)
skipping 195 more matches
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 2023-11-30 07:44 CET 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