| Publication | Date of Publication | Type |
|---|
| Truthfulness of a Network Resource-Sharing Protocol | 2024-02-27 | Paper |
| Insightful mining equilibria | 2023-08-04 | Paper |
| On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium | 2023-07-17 | Paper |
| ABSNFT: securitization and repurchase scheme for non-fungible tokens based on game theoretical analysis | 2023-05-26 | Paper |
| Distributed near-optimal matching | 2022-08-30 | Paper |
| Recent studies of agent incentives in Internet resource allocation and pricing | 2022-08-01 | Paper |
| Study on Agent Incentives for Resource Sharing on P2P Networks | 2022-07-22 | Paper |
| Incentive ratio: a game theoretical analysis of market equilibria | 2022-06-08 | Paper |
| Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design | 2022-06-08 | Paper |
| On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium | 2022-06-01 | Paper |
| Understanding PPA-completeness | 2020-10-23 | Paper |
| On Bayesian epistemology of Myerson auction | 2020-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111230 | 2020-05-26 | Paper |
| Multi‐Unit Bayesian Auction with Demand or Budget Constraints | 2019-11-27 | Paper |
| A novel business model for electric car sharing | 2019-10-11 | Paper |
| Agent incentives of strategic behavior in resource exchange | 2019-06-20 | Paper |
| Recent studies of agent incentives in internet resource allocation and pricing | 2019-02-22 | Paper |
| Limiting User’s Sybil Attack in Resource Sharing | 2019-01-30 | Paper |
| Network pollution games | 2019-01-11 | Paper |
| A polynomial-time approximation scheme for embedding hypergraph in a cycle | 2018-11-05 | Paper |
| Agent incentives of strategic behavior in resource exchange | 2018-02-13 | Paper |
| Understanding PPA-completeness | 2017-10-10 | Paper |
| Power-Law Distributions in a Two-Sided Market and Net Neutrality | 2017-02-10 | Paper |
| New Results for Network Pollution Games | 2016-09-02 | Paper |
| On revenue maximization with sharp multi-unit demands | 2016-04-13 | Paper |
| The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line | 2016-04-13 | Paper |
| Settling the complexity of computing two-player Nash equilibria | 2015-11-11 | Paper |
| Can Bandwidth Sharing Be Truthful? | 2015-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501852 | 2015-08-14 | Paper |
| Envy-free pricing in multi-item markets | 2015-08-14 | Paper |
| Universally balanced combinatorial optimization games | 2015-05-19 | Paper |
| Recent development in computational complexity characterization of Nash equilibrium | 2014-10-07 | Paper |
| Revenue maximization in a Bayesian double auction market | 2014-06-06 | Paper |
| Pricing Ad Slots with Consecutive Multi-unit Demand | 2013-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843928 | 2013-08-27 | Paper |
| Revenue Maximization in a Bayesian Double Auction Market | 2013-03-21 | Paper |
| Algorithmic Solutions for Envy-Free Cake Cutting | 2013-03-12 | Paper |
| Incentive Ratios of Fisher Markets | 2012-11-01 | Paper |
| Multi-bidding strategy in sponsored search auctions | 2012-07-03 | Paper |
| Equiseparability on terminal Wiener index | 2012-06-14 | Paper |
| Discrete Fixed Points: Models, Complexities, and Applications | 2012-05-24 | Paper |
| On incentive compatible competitive selection protocols | 2011-09-20 | Paper |
| How Profitable Are Strategic Behaviors in a Market? | 2011-09-16 | Paper |
| Approximate Rank Aggregation | 2011-03-18 | Paper |
| Majority Equilibrium for Public Facility Allocation | 2011-03-18 | Paper |
| Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets | 2010-09-07 | Paper |
| Envy-Free Pricing in Multi-item Markets | 2010-09-07 | Paper |
| Finding nucleolus of flow game | 2010-08-16 | Paper |
| On algorithms for discrete and approximate brouwer fixed points | 2010-08-16 | Paper |
| On the complexity of equilibria | 2010-08-05 | Paper |
| The computation of approximate competitive equilibrium is PPAD-hard | 2010-06-09 | Paper |
| Forward looking Nash equilibrium for keyword auction | 2010-03-24 | Paper |
| On the complexity of market equilibria with maximum social welfare | 2009-12-18 | Paper |
| On the complexity of 2D discrete fixed point problem | 2009-11-04 | Paper |
| Finding nucleolus of flow game | 2009-09-02 | Paper |
| Equiseparability on Terminal Wiener Index | 2009-07-02 | Paper |
| A simplicial approach for discrete fixed point theorems | 2009-04-29 | Paper |
| On the complexity of crossings in permutations | 2009-04-09 | Paper |
| On the Complexity of 2D Discrete Fixed Point Problem | 2009-03-12 | Paper |
| A More Natural Way to Construct Identity-Based Identification Schemes | 2009-03-10 | Paper |
| Properties of Symmetric Incentive Compatible Auctions | 2009-03-06 | Paper |
| Matching algorithmic bounds for finding a Brouwer fixed point | 2008-12-21 | Paper |
| Two-factor mutual authentication based on smart cards and passwords | 2008-11-19 | Paper |
| Arbitrage opportunities across sponsored search markets | 2008-11-18 | Paper |
| A new framework for the design and analysis of identity-based identification schemes | 2008-11-18 | Paper |
| Algorithmic Cooperative Game Theory | 2008-10-17 | Paper |
| Double Auction in Two-Level Markets | 2008-09-30 | Paper |
| Optimal dynamic portfolio selection with earnings-at-risk | 2008-09-23 | Paper |
| Multi-bidding Strategy in Sponsored Keyword Auction | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441837 | 2008-02-15 | Paper |
| Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set | 2008-01-04 | Paper |
| Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics | 2007-12-20 | Paper |
| On Walrasian price of CPU time | 2007-10-10 | Paper |
| Efficient Anonymous Roaming and Its Security Analysis | 2007-09-24 | Paper |
| Certificateless signature: a new security model and an improved generic construction | 2007-09-20 | Paper |
| On Incentive Compatible Competitive Selection Protocol | 2007-09-10 | Paper |
| A Simplicial Approach for Discrete Fixed Point Theorems | 2007-09-10 | Paper |
| Key Replacement Attack Against a Generic Construction of Certificateless Signature | 2007-09-07 | Paper |
| Public Key Cryptography - PKC 2006 | 2007-05-02 | Paper |
| A new numerical method an American option pricing | 2007-02-20 | Paper |
| Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers | 2007-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415763 | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415777 | 2007-01-19 | Paper |
| Computation of arbitrage in frictional bond markets | 2007-01-09 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Information Security | 2006-10-20 | Paper |
| Information Security and Privacy | 2006-06-22 | Paper |
| Condorcet winners for public goods | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3371143 | 2006-02-21 | Paper |
| A linear programming algorithm for optimal portfolio selection with transaction costs | 2006-02-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| On convergence of a semi-analytical method for American option pricing | 2005-12-16 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs | 2005-11-30 | Paper |
| A Min-Max Theorem on Feedback Vertex Sets | 2005-11-11 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024767 | 2005-07-04 | Paper |
| COMPUTATIONAL COMPLEXITY OF ARBITRAGE IN FRICTIONAL SECURITY MARKET | 2005-06-22 | Paper |
| A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING | 2005-06-22 | Paper |
| A minimax portfolio selection strategy with equilibrium | 2005-06-01 | Paper |
| A PTAS for semiconductor burn-in scheduling | 2005-05-17 | Paper |
| On-line scheduling a batch processing system to minimize total weighted job completion time | 2005-03-15 | Paper |
| On complexity of single-minded auction | 2005-02-23 | Paper |
| On the complexity of price equilibria | 2004-11-18 | Paper |
| Approximate and dynamic rank aggregation | 2004-10-27 | Paper |
| Minimizing mean completion time in a batch processing system | 2004-09-22 | Paper |
| Minimum \(k\) arborescences with bandwidth constraints | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737204 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737535 | 2004-08-11 | Paper |
| Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474071 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474104 | 2004-08-04 | Paper |
| Portfolio selection theory with different interest rates for borrowing and lending | 2004-03-15 | Paper |
| Approximation algorithms in batch processing | 2004-01-06 | Paper |
| On computational complexity of membership test in flow games and linear production games | 2003-11-23 | Paper |
| Genetic Design of Drugs Without Side-Effects | 2003-09-28 | Paper |
| Optimal portfolio selection of assets with transaction costs and no short sales | 2003-09-12 | Paper |
| Approximate sequencing for variable length tasks. | 2003-08-17 | Paper |
| Total balancedness condition for Steiner tree games. | 2003-06-10 | Paper |
| Center and distinguisher for strings with unbounded alphabet | 2003-06-09 | Paper |
| Symmetric duality for a class of multiobjective fractional programming problems. | 2003-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536961 | 2002-11-06 | Paper |
| Dynamic Arbitrage-Free Asset Pricing with Proportional Transaction Costs | 2002-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551363 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779606 | 2002-04-15 | Paper |
| A compromise solution to mutual funds portfolio selection with transaction costs | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751965 | 2002-02-12 | Paper |
| Robot map verification of a graph world | 2002-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709636 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729097 | 2001-10-23 | Paper |
| Wavelength allocation on trees of rings | 2001-10-14 | Paper |
| A 2-D parallel convex hull algorithm with optimal communication phases | 2001-08-20 | Paper |
| An Approximation Algorithm for Feedback Vertex Sets in Tournaments | 2001-06-21 | Paper |
| Totally balanced combinatorial optimization games | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527188 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526976 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525758 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788602 | 2001-01-01 | Paper |
| On approximating a scheduling problem | 2001-01-01 | Paper |
| Solution to a problem on degree sequences of graphs | 2000-12-13 | Paper |
| Graph algorithms with small communication costs | 2000-12-03 | Paper |
| Preemptive Scheduling of Parallel Jobs on Multiprocessors | 2000-10-18 | Paper |
| Algorithmic Aspects of the Core of Combinatorial Optimization Games | 2000-07-19 | Paper |
| Decision-making by hierarchies of discordant agents | 2000-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953331 | 2000-06-22 | Paper |
| Exploring an unknown graph | 2000-01-03 | Paper |
| A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766840 | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703145 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263703 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253477 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247447 | 1999-09-23 | Paper |
| How to learn an unknown environment. I | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394599 | 1998-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375743 | 1998-02-08 | Paper |
| Distributed near-optimal matching | 1998-01-07 | Paper |
| On multiprocessor system scheduling | 1998-01-01 | Paper |
| The Cost of Derandomization: Computability or Competitiveness | 1997-05-26 | Paper |
| A lower bound for communication on the crossbar | 1997-02-28 | Paper |
| A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers | 1997-01-01 | Paper |
| Competitive distributed decision-making | 1996-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875180 | 1996-09-15 | Paper |
| Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs | 1996-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140450 | 1994-11-29 | Paper |
| On the Complexity of Cooperative Solution Concepts | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976646 | 1992-06-26 | Paper |
| On path lengths modulo three | 1992-06-25 | Paper |
| More powerful closure operations on graphs | 1992-06-25 | Paper |
| Server problems and resistive spaces | 1991-01-01 | Paper |
| An optimal parallel algorithm for linear programming in the plane | 1990-01-01 | Paper |
| Implicit-degrees and circumferences | 1989-01-01 | Paper |
